QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#614955 | #8057. Best Carry Player 4 | SkyEyeController | WA | 85ms | 3784kb | C++23 | 997b | 2024-10-05 17:14:01 | 2024-10-05 17:14:01 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e7;
void solve()
{
int m;
cin >> m;
vector<int> a(m), b(m);
int sum1 = 0, sum2 = 0;
for (auto &x : a)
cin >> x, sum1 += x;
for (auto &x : b)
cin >> x, sum2 += x;
bool check = 0;
if (sum1 < sum2)
a[0] += sum2 - sum1;
if (sum1 > sum2)
b[0] += sum1 - sum2;
bool tag = 0;
int tmp = 0;
int ans = 0;
for (int i = 0; i < m; i++)
{
if (tmp)
tag = 1;
tmp += b[m - 1 - i];
int delta = min(a[i], tmp);
tmp -= delta;
ans += delta;
}
if (tag)
{
cout << ans << endl;
}
else
{
if (m == 2)
ans--;
else
ans -= 2;
cout << ans << endl;
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)
solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3752kb
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: 85ms
memory: 3784kb
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 0 4 0 3 2 3 2 0 0 1 -1 1 1 3 -1 -1 -2 -2 -1 1 1 4 -1 4 0 -2 2 3 3 1 5 1 0 2 1 -1 1 1 0 -1 3 5 3 2 2 0 0 1 2 3 2 -2 3 -1 2 1 1 -1 1 -2 4 0 0 2 2 0 3 3 0 2 0 0 0 -1 0 1 2 1 3 4 0 2 5 0 0 1 -1 -1 0 1 0 2 0 0 1 3 3 3 1 2 2 2 1 3 1 1 0 -1 0 1 0 3 2 2 -2 0 1 1 1 2 -2 1 1 4 1 3 3 2 2 2 0 0 -2 1 2 2 1 3 1...
result:
wrong answer 1st numbers differ - expected: '2', found: '0'