QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#450667#8057. Best Carry Player 4ucup-team3282WA 123ms7728kbC++201.9kb2024-06-22 16:54:402024-06-22 16:54:40

Judging History

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

  • [2024-06-22 16:54:40]
  • 评测
  • 测评结果:WA
  • 用时:123ms
  • 内存:7728kb
  • [2024-06-22 16:54:40]
  • 提交

answer

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
using namespace std;

int stk[1000050],tp=0;
int a[1000050],b[1000050],m;
int cnta,cntb;
long long ans=0;
bool fuck=false;
pair<int,int>lst;
void cmp(int p1,int p2){
    int r=min(a[p1],b[p2]);
    a[p1]-=r;b[p2]-=r;
    if(r>0)lst=make_pair(p1,p2);
    if(r>0&&p1+p2>=m)fuck=true;
    if(b[p2]>0)stk[++tp]=p2;
    ans+=r;
}
int main(){
    
    int t;cin>>t;
    for(int T=1;T<=t;T++){
        tp=0;fuck=false;
        cin>>m;
        cnta=cntb=0;ans=0;
        int mxa=0,mxb=0;
        for(int i=0;i<m;i++){
            cin>>a[i];cnta+=a[i];
            if(T==16)cout<<a[i]<<" ";
            if(a[i]){
                mxa=i;
            }
        }
        for(int i=0;i<m;i++){
            cin>>b[i];cntb+=b[i];
            if(T==16)cout<<b[i]<<" ";
            if(b[i]){
                mxb=i;
            }
        }
        if(mxa+mxb<m){
            cout<<0<<endl;
            continue;
        }
        cnta++;cntb++;
        if(cnta>cntb){b[0]+=cnta-cntb;}else{a[0]+=cntb-cnta;}
        for(int i=0;i<m;i++){
            stk[++tp]=m-i-1;    
            while(a[i]){
                if(tp==0)break;
                else{tp--;cmp(i,stk[tp+1]);}
            }
        }
        // cout<<lst.first<<","<<lst.second<<endl;
        for(int i=0;i<m;i++){
            if(b[i]&&i+lst.first>=m){
                fuck=1;
                // cout<<"A";
            }
            if(a[i]&&mxb+i>=m){
                fuck=1;
                // cout<<"B";
            }
        }
        for(int i=lst.first+1;i<m;i++){
            if(a[i]){
                fuck=1;
                // cout<<"C";
            }
        }
        if(fuck){
            cout<<ans<<endl;
        }else{
            cout<<ans-1<<endl;
        }
        
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 7728kb

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: 123ms
memory: 7724kb

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:

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

result:

wrong answer 18th numbers differ - expected: '0', found: '1'