QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #739202 | #8057. Best Carry Player 4 | shengZzz | WA | 48ms | 3600kb | C++20 | 1.9kb | 2024-11-12 21:09:20 | 2024-11-12 21:09:23 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
#define int long long
void solve() {
int m;
cin>>m;
vector<int> a(m);
vector<int> b(m);
for(int i=0;i<m;i++){
cin>>a[i];
}
for(int i=0;i<m;i++){
cin>>b[i];
}
int ans=0;
// for(int i=1;i<m;i++){
// if(a[i]!=0 && b[m-i]!=0){
// ++ans;
// --a[i];
// --b[m-i];
// break;
// }
// if(b[i]!=0 && a[m-i]!=0){
// ++ans;
// --b[i];
// --a[m-i];
// break;
// }
// }
int flag=1;
ans+=b[m-1];
int i=1,j=m-2;
while(i<m && j>=0){
if(a[i]!=0 && b[j]!=0 && i+j>=m-1){
if(a[i]<=b[j]){
if(j+i>=m) flag=0;
ans+=a[i];
b[j]-=a[i];
a[i]=0;
++i;
continue;
}
else{
if(j+i>=m) flag=1;
ans+=b[j];
a[i]-=b[j];
--j;
continue;
}
}
if(i+j<m-1){
++i;
continue;
}
if(a[i]==0&&b[j]!=0){
++i;
continue;
}
if(b[j]==0&&a[i]!=0){
--j;
continue;
}
if(b[j]==0&&a[i]==0){
--j;
++i;
continue;
}
}
ans-=flag;
cout<<ans<<"\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("inn.in","r",stdin);
int T;
cin>>T;
while(T--) {
solve();
}
return 0;
}
/*
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3548kb
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: 48ms
memory: 3600kb
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:
0 -1 4 -1 3 3 3 0 -1 -1 1 0 2 0 3 -1 -1 -1 -1 0 0 0 4 0 2 1 -1 2 2 1 1 2 0 -1 1 0 -1 1 1 -1 -1 3 3 3 0 2 1 -1 0 2 2 1 -1 2 0 2 1 1 -1 0 -1 4 -1 -1 2 2 -1 3 3 -1 1 -1 0 -1 0 0 1 2 0 2 4 -1 1 3 -1 0 1 -1 -1 -1 2 0 2 -1 1 0 4 3 2 0 0 1 1 0 3 0 0 -1 -1 -1 0 -1 3 2 2 -1 1 0 1 0 1 -1 0 2 4 1 2 3 1 1 2 -1 ...
result:
wrong answer 1st numbers differ - expected: '2', found: '0'