QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#373172 | #8057. Best Carry Player 4 | UNos_maricones# | WA | 42ms | 3812kb | C++20 | 1.2kb | 2024-04-01 05:12:52 | 2024-04-01 05:12:53 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
typedef long double lf;
typedef pair< int, int > pii;
const int INF = (int) 1e9;
const int N = 3000;
int main()
{
ios_base::sync_with_stdio( 0 );
cin.tie( NULL );
int t; cin >> t;
while (t--) {
int m; cin >> m;
ll ans = 0;
vector <ll> va (m), vb (m);
ll cn_a = 0, cn_b = 0;
for (auto &e : va) cin >> e, cn_a += e;
for (auto &e : vb) cin >> e, cn_b += e;
ll mn = max(cn_a, cn_b);
va[0] += mn - cn_a;
vb[0] += mn - cn_b;
int i = 0, j = m - 1;
int may_m = 0;
while (i < m && j >= 0) {
if ( vb[j] == 0 ) j--;
else if ( va[i] == 0 ) i++;
else if ( i + j < m - 1 ) i++;
else {
int ds = min(vb[j], va[i]);
va[i] -= ds;
vb[j] -= ds;
ans += ds;
may_m |= ( i + j >= m );
}
}
ans -= (may_m == 0);
cout << ans << '\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3812kb
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: 42ms
memory: 3556kb
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 -1 4 -1 3 3 3 2 -1 -1 1 0 2 0 3 0 0 -1 -1 0 0 0 4 0 4 1 -1 2 3 3 1 5 0 -1 2 0 0 1 1 -1 0 3 5 3 2 2 1 -1 0 2 2 2 -1 3 0 2 1 1 0 1 -1 4 1 1 2 2 -1 3 3 -1 2 -1 1 -1 0 1 1 2 0 3 4 -1 2 5 -1 1 1 0 0 -1 2 1 3 -1 1 0 4 3 3 0 2 2 1 1 3 1 1 -1 0 -1 1 -1 3 2 2 -1 1 0 1 0 1 -1 0 2 4 1 2 3 2 2 2 -1 1 -1 0 2 3...
result:
wrong answer 1st numbers differ - expected: '2', found: '1'