CodeForces - 975C- Valhalla Siege （前缀和）

C. Valhalla Siege

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.

Ivar has $n$ warriors, he places them on a straight line in front of the main gate, in a way that the $i$-th warrior stands right after $(i-1)$-th warrior. The first warrior leads the attack.

Each attacker can take up to $a_i$ arrows before he falls to the ground, where $a_i$ is the $i$-th warrior's strength.

Lagertha orders her warriors to shoot $k_i$ arrows during the $i$-th minute, the arrows one by one hit the first still standing warrior. After all Ivar's warriors fall and all the currently flying arrows fly by, Thor smashes his hammer and all Ivar's warriors get their previous strengths back and stand up to fight again. In other words, if all warriors die in minute $t$, they will all be standing to fight at the end of minute $t$.

The battle will last for $q$ minutes, after each minute you should tell Ivar what is the number of his standing warriors.

Input

The first line contains two integers $n$ and $q$ ($1\le n,q\le 200000$) — the number of warriors and the number of minutes in the battle.

The second line contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le {10}^9$) that represent the warriors' strengths.

The third line contains $q$ integers $k_1,k_2,\dots ,k_q$ ($1\le k_i\le {10}^{14}$), the $i$-th of them represents Lagertha's order at the $i$-th minute: $k_i$ arrows will attack the warriors.

Output

Output $q$ lines, the $i$-th of them is the number of standing warriors after the $i$-th minute.

Examples

input

Copy

5 5
1 2 1 2 1
3 10 1 1 1

output

Copy

3
5
4
4
3

input

Copy

4 4
1 2 3 4
9 1 10 6

output

Copy

1
4
4
1

Note

In the first example:

• after the 1-st minute, the 1-st and 2-nd warriors die.
• after the 2-nd minute all warriors die (and all arrows left over are wasted), then they will be revived thus answer is 5 — all warriors are alive.
• after the 3-rd minute, the 1-st warrior dies.
• after the 4-th minute, the 2-nd warrior takes a hit and his strength decreases by 1.

• after the 5-th minute, the 2-nd warrior dies.

题意：n个士兵，k个飞剑（这剑打人的，远离），然后跟着n个数代表士兵的HP（好像这么写，反正就是英文表示生命值的意思），跟着k个数表示飞剑的攻击力，然后问你每次过来一个飞剑还剩下多少个士兵，士兵只有没HP才挂了，并且如果所有的士兵都挂了，那么所有士兵立即复活，并且这个飞剑就不用管了。（一开始以为士兵复活剩下的飞剑的攻击力继续攻击）。

思路：明显的前缀和问题，给的数据n&k是2e5+10，直接找肯定超时（省赛可能能过哈哈哈哈哈哈 自嘲），所以二分找就好了，直接用了lower _bound；

复杂度 n*logn；

代码实现：

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
#define ll long long
ll a[maxn];
int main()
{
    int n,p;
    scanf("%d%d",&n,&p);
    a[0]=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
        a[i]+=a[i-1];
    }
    ll sum=0;
    while(p--)
    {
        ll k;
        scanf("%lld",&k);
        sum+=k;
        if(sum>=a[n])
        {
            printf("%d\n",n);
            sum=0;
            continue;
        }
        int number=lower_bound(a+1,a+1+n,sum)-a;
        //cout<<"number==="<<number<<endl;
        if(sum==a[number])
        {
            printf("%d\n",n-number);
        }
        else
        {
            printf("%d\n",n-number+1);
        }

    }
    return 0;
}