QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#371747 | #8057. Best Carry Player 4 | Credit | WA | 1ms | 3548kb | C++17 | 1.6kb | 2024-03-30 15:30:41 | 2024-03-30 15:30:42 |
Judging History
answer
#include<iostream>
using namespace std;
int a[500005], b[500005];
bool flag = 0,flag1=0;
int m;
int xiaochu(int front, int back) {
long long int sum = 0;
if (a[back] > 0 && b[front] >= 0 && front < m && a[back] > b[front]) {
a[back] -= b[front];
sum += b[front];
b[front] = 0;if (front + back == m)flag1 = 1;
sum += xiaochu(front + 1, back);
}
if (a[back] > 0 && b[front] > 0 && a[back] <= b[front]) {
b[front] -= a[back];
sum += a[back];if (front + back == m)flag1 = 1;
a[back] = 0;
}
//cout<<sum<<' ';
return sum;
}
void solve() {
long long int num = 0, na = 0, nb = 0;
flag = 0;
cin >> m;
for (int i = 0;i < m;i++) {
cin >> a[i];
na += a[i];
}
for (int i = 0;i < m;i++) {
cin >> b[i];
nb += b[i];
}
b[m] = 0;
a[m] = 0;
if (na > nb) {
b[0] += na - nb;
}
else {
a[0] += nb - na;
}
for (int i = m - 1;i >= 1;i--) {
if (a[i] > 0 && b[m - i] > 0) {
a[i]--;
b[m - i]--;
num += 1;
flag = 1;
//cout<<"flag="<<flag<<endl;
break;
}
}
for (int i = m - 1;i >= 0;i--) {
int u;u = xiaochu(m - i - 1, i);
num += u;
// cout<<"u="<<u<<' ';
}
cout << flag1 << endl;
if (!flag && num > 0 && !flag1) {
cout << num - 1 << endl;
}
else {
cout << num << endl;
}
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
}
詳細信息
Test #1:
score: 0
Wrong Answer
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:
0 5 0 1 0 2 1 467900 1 29
result:
wrong answer 1st numbers differ - expected: '5', found: '0'