QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#614192 | #8057. Best Carry Player 4 | peiyangwjx# | WA | 43ms | 7700kb | C++20 | 1.6kb | 2024-10-05 15:51:38 | 2024-10-05 15:51:39 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int a[500010];
int b[500010];
int ua;
int sufb[500010];
int prea[500010];
int ans;
int sum;
int lsb,lsa;
int m;
int sum1,sum2;
int run(int sum1,int sum2){
ua=ans=sum=lsb=lsa=0;
for(int i=m-1;i>=1;i--){
sufb[i]=sufb[i+1]+b[i];
}
ans=min(a[1],b[m]);
int re=b[m]-ans;
ua+=ans;
for(int i=2;i<=m;i++){
int tmp=(min(a[i],sufb[m+1-i]-ua));
ans+=tmp;
ua+=tmp;
if(ua<sufb[m+1-i]){
lsb=max(lsb,m+1-i);
}
}
if(lsb){
bool fi=false;
for(int i=m+2-lsb;i<=m;i++){
if(a[i]){
fi=true;
break;
}
}
if(!fi)ans--;
}else{
ans--;
}
for(int i=1;i<=m;i++){
sufb[i]=0;
}
return ans+re;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
cin>>m;
int posa=0,posb=0;
sum1=0;
sum2=0;
for(int i=1;i<=m;i++){
cin>>a[i];
sum1+=a[i];
if(a[i])posa=max(posa,i);
}
for(int i=1;i<=m;i++){
cin>>b[i];
sum2+=a[i];
if(b[i])posb=max(posb,i);
}
if(posa+posb<=m+1){
cout<<0<<endl;
continue;
}
int ans1=run(sum1,sum2);
for(int i=1;i<=m;i++){
swap(a[i],b[i]);
}
ans1=max(ans1,run(sum2,sum1));
cout<<ans1<<endl;
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 7692kb
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: 43ms
memory: 7700kb
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 1 3 1 0 0 1 1 2 0 2 0 0 0 0 0 0 0 4 0 3 1 0 2 3 3 1 5 0 0 2 0 0 1 1 0 0 3 5 3 2 2 1 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 2 4 0 2 5 0 2 1 0 0 0 2 2 2 0 2 0 4 2 3 0 1 2 0 1 3 1 1 0 0 0 0 0 3 2 2 0 2 1 1 0 1 0 0 2 4 1 3 1 2 2 2 0 2 0 0 1 3 1 3 1 0 2 2 2 0 1 2 0 1 1 ...
result:
wrong answer 6th numbers differ - expected: '3', found: '1'