QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#293250 | #7786. Graft and Transplant | ucup-team191# | WA | 0ms | 1568kb | C++14 | 340b | 2023-12-29 02:38:25 | 2023-12-29 02:38:26 |
Judging History
answer
#include <cstdio>
using namespace std;
const int N = 55;
int n, deg[N];
int main(){
scanf("%d", &n);
for(int i = 1;i < n;i++) {
int a, b; scanf("%d%d", &a, &b);
deg[a]++, deg[b]++;
}
int list = 0;
for(int i = 1;i <= n;i++) list += deg[i] == 1;
printf(((n - 1 - list) & 1) ? "Alice\n" : "Bob\n");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1568kb
input:
4 1 2 2 3 3 4
output:
Alice
result:
ok "Alice"
Test #2:
score: 0
Accepted
time: 0ms
memory: 1548kb
input:
4 1 2 1 3 1 4
output:
Bob
result:
ok "Bob"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 1464kb
input:
2 1 2
output:
Alice
result:
wrong answer 1st words differ - expected: 'Bob', found: 'Alice'