Codeforces Round #478 (Div. 2) C. 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个人，血量是ai,有q轮攻击，分别为ki,第一个人在最前面先抵挡攻击，第一个人倒下了（血量为0）则第二个人。。

以此类推。。问一次攻击还剩下多少人，如果全部人都倒下了，则瞬间全部复活。。。

思路：直接模拟肯定不对，于是想到二分，二分什么呢？二分前缀和吧，那么每次都加上前缀和去二分，人全部倒下，重新计算就好了，本来写出来了，没想到输入写错了，以至于错了，好气啊！！！

代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 2e5+7;
int n, q;
ll a[maxn], k[maxn], sum[maxn];

init()
{
    sum[0] = a[0];
    for(int i  = 1; i < n; i++) sum[i] = sum[i - 1] + a[i];
}

int main()
{
    while(~scanf("%d%d",&n,&q))
    {
        for(int i = 0; i < n; i++) scanf("%lld",&a[i]);
        init();
        for(int i = 0; i < q; i++) scanf("%lld",&k[i]);
        ll qz = 0;
        for(int i = 0; i < q; i++)
        {
            ll kq = k[i] + qz;
            int pos = lower_bound(sum, sum+n, kq) - sum;
            if(pos == n||(pos == n-1&&sum[pos] == kq)){
                printf("%d\n", n);
                qz = 0;
            } else {
                if(sum[pos] == kq) {
                    printf("%d\n", n - pos - 1);
                    qz = kq;
                } else {
                    printf("%d\n", n - pos);
                    qz = kq;
                }
            }
        }
    }
    return 0;
}