QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#750944#8057. Best Carry Player 4kjhhjki#WA 38ms5712kbC++201.0kb2024-11-15 16:26:562024-11-15 16:26:56

Judging History

你现在查看的是最新测评结果

  • [2024-11-15 16:26:56]
  • 评测
  • 测评结果:WA
  • 用时:38ms
  • 内存:5712kb
  • [2024-11-15 16:26:56]
  • 提交

answer

#include<bits/stdc++.h>
#define N 1000010
#define ll long long
using namespace std;
int n,T;
ll a[N],b[N];

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>T;
    while(T--){
        cin>>n;
        int fa=0,fb=0;
        for(int i=0;i<n;i++){
            cin>>a[i];
            if(a[i]) fa=i;
        }
        for(int i=0;i<n;i++){
            cin>>b[i];
            if(b[i]) fb=i;
        }
        a[0]=b[0]=1e18;
        if(fa+fb<n){
            cout<<"0\n";
            continue;
        }
        int pi=0;
        ll sum=0,fz=0;
        for(int i=n-1;i>=0;i--){
            if(pi+i<n-1) pi++;
            while(pi<n&&a[pi]<=b[i]){
                if(a[pi]&&pi+i>=n) fz=1;
                b[i]-=a[pi];
                sum+=a[pi];
                a[pi]=0;
                pi++;
            }
            if(a[pi]>b[i]){
                if(b[i]&&pi+i>=n) fz=1;
                sum+=b[i],a[pi]-=b[i],b[i]=0;
            }
        }
        cout<<sum+fz-1<<'\n';
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5712kb

input:

5
2
1 2
3 4
3
1 0 1
0 1 0
4
1 0 0 1
1 1 1 1
5
123456 114514 1919810 233333 234567
20050815 998244353 0 0 0
10
5 3 5 3 2 4 2 4 1 5
9 9 8 2 4 4 3 5 3 0

output:

5
1
2
467900
29

result:

ok 5 number(s): "5 1 2 467900 29"

Test #2:

score: -100
Wrong Answer
time: 38ms
memory: 5648kb

input:

100000
5
0 1 1 1 1
0 0 1 0 0
5
0 0 0 0 0
1 1 1 0 0
5
0 0 2 1 1
0 2 1 0 1
5
0 0 0 0 0
1 2 1 0 0
5
0 1 0 1 1
0 0 1 1 1
5
2 0 0 0 1
1 0 0 0 3
5
2 0 0 1 1
0 2 1 1 1
5
0 0 0 0 2
0 0 0 0 1
5
0 0 0 0 0
0 1 1 0 0
5
4 0 0 0 0
0 0 0 1 0
5
0 0 0 0 1
2 1 1 0 0
5
0 2 3 0 0
0 0 0 1 0
5
1 1 1 0 1
1 0 1 0 1
5
0 0 0...

output:

1
0
4
0
4
3
3
2
0
0
1
0
2
0
3
0
0
0
0
0
0
0
4
0
4
1
0
2
3
2
1
4
0
0
2
0
0
1
1
0
0
3
5
3
1
2
1
0
0
2
2
2
0
3
0
2
1
1
0
0
0
4
0
0
2
2
0
3
3
0
1
0
1
0
0
1
1
2
0
2
4
0
2
5
0
1
1
0
0
0
2
1
3
0
1
0
4
3
3
0
2
2
0
1
3
0
1
0
0
0
1
0
3
2
2
0
1
0
1
0
1
0
0
2
4
1
2
3
2
2
2
0
1
0
0
2
3
1
3
0
0
2
2
3
0
1
1
0
1
1
...

result:

wrong answer 1st numbers differ - expected: '2', found: '1'