QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#672942 | #8057. Best Carry Player 4 | lonelywolf# | WA | 46ms | 3600kb | C++20 | 846b | 2024-10-24 19:58:31 | 2024-10-24 19:58:32 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int m;
cin >> m;
int sa = 0, sb = 0;
vector<int> a(m), b(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
sa += a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
sb += b[i];
}
if (sa > sb) {
b[0] += sa - sb;
} else {
a[0] += sb - sa;
}
reverse(b.begin(), b.end());
int s = 0;
int ans = 0;
bool ok = true;
for (int i = 0; i < m; i++) {
if (s > 0) {
ok = false;
}
s += b[i];
if (s >= a[i]) {
s -= a[i];
ans += a[i];
} else {
ans += s;
s = 0;
}
}
cout << ans - ok << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 46ms
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:
1 0 4 0 3 3 3 2 0 0 1 0 2 1 3 0 0 -1 -1 0 1 1 4 0 4 1 -1 2 3 3 1 5 1 0 2 1 0 1 1 0 0 3 5 3 2 2 1 0 1 2 3 2 -1 3 0 2 1 1 0 1 -1 4 1 1 2 2 0 3 3 0 2 0 1 0 0 1 1 2 1 3 4 0 2 5 0 1 1 0 0 0 2 1 3 0 1 1 4 3 3 1 2 2 2 1 3 1 1 0 0 0 1 0 3 2 2 -1 1 1 1 1 2 -1 1 2 4 1 3 3 2 2 2 0 1 -1 1 2 3 1 3 1 0 3 2 3 0 1 ...
result:
wrong answer 1st numbers differ - expected: '2', found: '1'