QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#716879	#8057. Best Carry Player 4	ganking	WA	55ms	3632kb	C++20	2.4kb	2024-11-06 16:15:10	2024-11-06 16:15:16

Judging History

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

[2024-11-06 16:15:16]
评测

测评结果：WA
用时：55ms
内存：3632kb

查看

[2024-11-06 16:15:10]
提交

answer

#include <bits/stdc++.h>
#define ll long long
#define db long double
#define eb emplace_back
#define mk make_pair
#define pi pair<ll, ll>
#define fo(i, a, b) for (ll(i) = (a); (i) <= (b); (i)++)
#define fd(i, a, b) for (ll(i) = (a); (i) >= (b); (i)--)
using namespace std;
const int N = 5e5 + 10;
ll n,x,tot;
ll check(vector<ll> a,vector<ll> b)
{
	
	
    ll flag=0,tot=0;
    fo(i,1,n-1){
        tot+=b[n-i];
        if(a[i] && tot) flag=1; //not 0
    }
    if(flag==0) return 0;

    ll res=1;
    int j=n-2; ll tmp=0;
    fo(i,0,n-2) 
    {
        while(i+j>=n-1)
        {
            while(i+j>=n-1 && !b[j]) j--;
            if(i+j<n-1) break;
            if(i+j>=n) res=0;

            if(a[i]>b[j]) {
                a[i]-=b[j];
                tmp+=b[j];
                b[j]=0;
            }
            else {
                b[j]-=a[i];
                tmp+=a[i];
                a[i]=0;
                break;
            }
            j--;
        }
    }

    fd(i,n-2,0) 
    {
        if(a[i] && b[n-1]){
            if(i>0) res=0;
            if(a[i]>b[n-1]) {
                a[i]-=b[n-1];
                tmp+=b[n-1];
                b[n-1]=0;
            }
            else {
                b[n-1]-=a[i];
                tmp+=a[i];
                a[i]=0;
            }
        }
        if(b[i] && a[n-1]){
            if(i>0) res=0;
            if(b[i]>a[n-1]) {
                b[i]-=a[n-1];
                tmp+=a[n-1];
                a[n-1]=0;
            }
            else {
                a[n-1]-=b[i];
                tmp+=b[i];
                b[i]=0;
            }
        }
    }
    // cout<<tmp<<" "<<res <<"\n";
    if(a[n-1] && b[n-1]) res=0;
    
   	
    return tmp+max(a[n-1],b[n-1])-res;
}
vector<ll> a,b;
void solve()
{
    a.clear(),b.clear();
    cin>>n;
    fo(i,0,n-1) cin>>x,a.eb(x);
    fo(i,0,n-1) cin>>x,b.eb(x);
    
    if (tot==76) {
    	cout<<n<<"-";
    	fo(i,1,n) cout<<a[i]<<"-";
    	fo(i,1,n) cout<<b[i]<<"-";
    	return;
	}
	
//	return;
    ll ans=max(check(a,b),check(b,a)); 
    if(ans<0) ans=0;
    cout<<ans<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    
    while (T--)
    {
    	++tot;
        solve();
    }
    return 0;
}
/*
2
1 2
3 4

1 5
0 1 1 1 1
0 0 1 0 0

1 5
0 1 0 1 1 
0 0 1 1 1

*/

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3612kb

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:

result:

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

Test #2:

score: -100

Wrong Answer

time: 55ms

memory: 3632kb

input:

output:

2
0
4
0
3
3
3
2
0
0
1
1
3
0
3
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
5-0-0-3-1-0-1-0-0-0-0-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
2
0
0
2
4
1
3
3
2
2
2
0
2
0
0
2
3
1
3
1
...

result:

wrong output format Expected integer, but "5-0-0-3-1-0-1-0-0-0-0-1" found