QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #692660 | #7786. Graft and Transplant | 123456zmy# | WA | 0ms | 4016kb | C++17 | 316b | 2024-10-31 14:52:51 | 2024-10-31 14:52:52 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y,u;
scanf("%d",&n);
vector<int>d(n+1);
for (int i=1;i<n;i++)scanf("%d %d",&x,&y),d[x]++,d[y]++;
for (int i=1;i<=n;i++)d[i]--;
for (int i=1;i<=n;i++)u+=(d[i]>0);
if (u%2)printf("Bob\n");else printf("Alice\n");
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 4016kb
input:
4 1 2 2 3 3 4
output:
Alice
result:
ok "Alice"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
4 1 2 1 3 1 4
output:
Bob
result:
ok "Bob"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3792kb
input:
2 1 2
output:
Alice
result:
wrong answer 1st words differ - expected: 'Bob', found: 'Alice'