首页 > 代码库 > (校赛）URAL 1998 The old Padawan

(校赛）URAL 1998 The old Padawan

2024-07-14 13:47:01   224人阅读

Luke Skywalker is having exhausting practice at a God-forsaken planet Dagoba. One of his main difficulties is navigating cumbersome objects using the Power. Luke’s task is to hold several stones in the air simultaneously. It takes complete concentration and attentiveness but the fellow keeps getting distracted.
Luke chose a certain order of stones and he lifts them, one by one, strictly following the order. Each second Luke raises a stone in the air. However, if he gets distracted during this second, he cannot lift the stone. Moreover, he drops some stones he had picked before. The stones fall in the order that is reverse to the order they were raised. They fall until the total weight of the fallen stones exceeds k kilograms or there are no more stones to fall down.
The task is considered complete at the moment when Luke gets all of the stones in the air. Luke is good at divination and he can foresee all moments he will get distracted at. Now he wants to understand how much time he is going to need to complete the exercise and move on.

Input

The first line contains three integers: n is the total number of stones, m is the number of moments when Luke gets distracted and k (1 ≤ n, m ≤ 105, 1 ≤ k ≤ 109). Next n lines contain the stones’ weights wi (in kilograms) in the order Luke is going to raise them (1 ≤ wi ≤ 104). Next m lines contain moments ti, when Luke gets distracted by some events (1 ≤ ti ≤ 109, ti < ti+1).

Output

Print a single integer — the number of seconds young Skywalker needs to complete the exercise.

Sample

inputoutput
5 1 4
1
2
3
4
5
4

8

今天看到了二分方法，好犀利。。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<limits.h>
using namespace std;
const int maxn=1e5;
int T[maxn],a[maxn],sum[maxn];
int n,t,k;
int  solve(int x)//二分得大于x的最小位置i
{
    int l=0,r=n;
    int ans;
    while(l<=r)
    {
       int mid=(l+r)>>1;
       if(sum[mid]<x)
       {
           ans=mid;
           l=mid+1;
       }
       else
        r=mid-1;
    }
    return ans;
}
int main()
{
    while(cin>>n>>t>>k)
    {
        sum[0]=0;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            sum[i]=sum[i-1]+a[i];
        }
        for(int i=1;i<=t;i++)
           cin>>T[i];//第几秒
        t++;
        T[t]=2000000000;//最后没有分心时间的时候可以做if语句做完事情
        int pos=0,to;
        int ans=0;
        for(int i=1;i<=t;i++)
        {
            if(n-pos<T[i]-ans)//T[i]时间内可以做完
            {
                ans+=n-pos;
                break;
            }
            else
            {
                to=T[i]-ans+pos;//分心的时候到了第几个位置及当前位置pos加上还要走的距离(T[i]-ans);
                ans+=T[i]-ans;//ans,当前走了多少时间
                pos=solve(sum[to-1]-k);//找到分心后的位置
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}


联系
我们