Valhalla Siege

Posted 行远山

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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 nn warriors, he places them on a straight line in front of the main gate, in a way that the ii-th warrior stands right after (i?1)(i?1)-th warrior. The first warrior leads the attack.

Each attacker can take up to aiai arrows before he falls to the ground, where aiai is the ii-th warrior‘s strength.

Lagertha orders her warriors to shoot kiki arrows during the ii-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 tt, they will all be standing to fight at the end of minute tt.

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

Input

The first line contains two integers nn and qq (1n,q2000001≤n,q≤200000) — the number of warriors and the number of minutes in the battle.

The second line contains nn integers a1,a2,,ana1,a2,…,an (1ai1091≤ai≤109) that represent the warriors‘ strengths.

The third line contains qq integers k1,k2,,kqk1,k2,…,kq (1ki10141≤ki≤1014), the ii-th of them represents Lagertha‘s order at the ii-th minute: kiki arrows will attack the warriors.

Output

Output qq lines, the ii-th of them is the number of standing warriors after the ii-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.

记录前缀,upper_bound二分。

#include <iostream>
#include <bits/stdc++.h>
#define maxn 200005
using namespace std;
typedef long long ll;
ll a[maxn]={0};
ll sum[maxn]={0};
ll b[maxn]={0};
int main()
{
    int n,q,i;
    scanf("%d%d",&n,&q);
    for(i=1;i<=n;i++)
    {
        scanf("%I64d",&a[i]);
        sum[i]=sum[i-1]+a[i];
    }
    for(i=1;i<=q;i++)
    {
        scanf("%I64d",&b[i]);
    }
    ll tmp=0;
    for(i=1;i<=q;i++)
    {
        tmp+=b[i];
        if(tmp>=sum[n])
        {
            tmp=0;
            cout<<n<<endl;
        }
        else
        {
            int index=upper_bound(sum+1,sum+1+n,tmp)-sum-1;
            cout<<n-index<<endl;
        }
    }
    return 0;
}

  

以上是关于Valhalla Siege的主要内容,如果未能解决你的问题,请参考以下文章

html LRM-Valhalla的最低可行实施

siege压力测试支持https吗

JEP解读与尝鲜系列4 - Java 16 中对于 Project Valhalla 的铺垫

JEP解读与尝鲜系列4 - Java 16 中对于 Project Valhalla 的铺垫

linux系统里模拟并发请求siege

siege压力测试