QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #321557 | #6789. Yet Another Game of Stones | iee | AC ✓ | 61ms | 3948kb | C++17 | 871b | 2024-02-04 22:53:34 | 2024-02-04 22:53:35 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (b[i] == 2 && a[i] % 2) {
cout << "Bob" << "\n";
return;
}
if (b[i] == 2) cnt++;
else if (b[i] == 1 && a[i] >= 2) cnt++;
}
if (cnt >= 2) {
cout << "Bob" << "\n";
return;
}
int xorsum = 0;
for (int i = 0; i < n; i++) {
if (b[i] == 1 && a[i] >= 2) {
xorsum ^= !(a[i] % 2);
} else if (b[i] != 2) {
xorsum ^= a[i];
}
}
if (cnt == 1) xorsum = !xorsum;
if (xorsum) {
cout << "Alice" << "\n";
} else {
cout << "Bob" << "\n";
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3548kb
input:
3 2 4 1 1 0 1 3 2 1 1 2
output:
Alice Bob Bob
result:
ok 3 tokens
Test #2:
score: 0
Accepted
time: 61ms
memory: 3948kb
input:
1015 7 2 3 4 1 5 1 4 0 0 0 0 0 1 2 6 6 5 5 6 5 1 0 1 2 2 2 1 4 2 6 2 3 0 0 0 0 3 4 5 5 0 2 2 6 6 1 6 1 4 5 2 1 1 0 2 0 3 4 4 3 0 1 2 5 6 3 5 4 4 1 2 0 1 1 5 6 3 1 1 5 1 2 1 1 2 4 3 4 5 3 0 0 0 2 4 6 1 5 1 2 1 2 2 5 1 4 3 2 6 1 2 0 0 2 4 6 2 1 1 0 0 2 2 1 6 2 3 5 1 4 2 0 0 1 5 0 6 1 6 6 4 5 6 1 2 1 0...
output:
Alice Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Alice Bob Bob Bob Bob Alice Bob Alice Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Alice Al...
result:
ok 1015 tokens