QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #349991 | #8295. Binary Tree | ucup-team1209# | AC ✓ | 3ms | 3668kb | C++20 | 396b | 2024-03-10 11:16:06 | 2024-03-10 11:16:07 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int T, n;
void Main() {
cin >> n;
for(int i = 1; i < n; i++) {
int x, y; cin >> x >> y;
}
cout << ((n & 1) ? "Alice" : "Bob") << '\n';
}
int main() {
#ifdef zqj
freopen("1.in","r",stdin);
#endif
ios :: sync_with_stdio(0), cin.tie(0);
cin >> T;
while(T--) Main();
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
input:
1 5 1 2 1 3 3 4 3 5
output:
Alice
result:
ok single line: 'Alice'
Test #2:
score: 0
Accepted
time: 3ms
memory: 3556kb
input:
1001 1 14 1 2 1 8 2 3 2 4 3 6 4 5 4 9 5 7 5 12 6 13 7 11 8 14 9 10 42 1 2 1 6 2 3 2 5 3 4 3 7 4 10 5 12 6 9 6 24 7 8 7 20 8 13 8 34 9 11 9 14 10 16 10 22 11 18 11 40 12 39 13 15 14 19 15 17 15 21 16 31 17 26 18 32 19 29 19 35 20 38 21 25 22 23 23 27 24 30 25 28 30 42 31 33 33 36 33 41 34 37 27 1 2 1...
output:
Alice Bob Bob Alice Bob Bob Bob Alice Alice Bob Alice Alice Alice Alice Alice Alice Bob Alice Bob Alice Bob Bob Bob Alice Bob Alice Bob Bob Alice Alice Bob Bob Bob Alice Alice Alice Bob Alice Alice Alice Bob Bob Alice Bob Bob Alice Alice Alice Alice Bob Bob Bob Bob Alice Bob Alice Bob Bob Bob Bob Al...
result:
ok 1001 lines
Extra Test:
score: 0
Extra Test Passed