Codeforces 975C 二分

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次攻击，q个勇士，每次攻击按顺序减少勇士的生命值。所有勇士都死后，在当轮结束时，所有勇士复活。

输出每次攻击后有多少勇士。

思路：

一开始想到暴力，直接对攻击进行相加，模拟，但如果遇见极端情况(所有攻击均为1e9，所有勇士生命值均为1)，则绝对会超时(每轮模拟需要计算所有勇士)。这种方法明显是不行的。

于是想到了二分，先对所有勇士的生命求前缀和，然后通过二分查找能击倒多少勇士。

代码如下：

#include <bits/stdc++.h>

using namespace std;

const int maxn = 200005;
typedef long long LL;
LL a[maxn], k[maxn];
int n, q;

int findpos(LL x){
    int head = 1, mid, tail = n;
    int ans = 0;
    while (head <= tail){
        mid = (head+tail)/2;
        if (a[mid] > x){
            tail = mid-1;
        } else {
            ans = max(ans,mid);
            head = mid+1;
        }
    }
    return ans;
}
int main()
{
    scanf("%d%d",&n, &q);
    a[0] = 0;
    for (int i=1; i<=n; i++){
        scanf("%I64d",&a[i]);
        a[i] += a[i-1];
    }
    for (int i=0; i<q; i++){
        scanf("%I64d",&k[i]);
    }
    LL tot = 0;
    for (int i=0 ;i<q; i++){
        tot += k[i];
        //cout<<"tot="<<tot<<endl;
        int tmp = findpos(tot);
        if (tmp >= n){
            printf("%d\n",n);
            tot = 0;
        } else {
            printf("%d\n",n-tmp);
        }
    }
    return 0;
}