QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #790630 | #7786. Graft and Transplant | zhilin# | WA | 1ms | 3760kb | C++14 | 345b | 2024-11-28 14:11:50 | 2024-11-28 14:11:52 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
int a[333];
using namespace std;
int main(){
int n;cin>>n;
for(int i=1;i<n;i++)
{
int u,v;
cin>>u>>v;
a[u]++;
a[v]++;
}
int ans=0;
for(int i=1;i<=n;i++)
{
if(a[i]==1)ans++;
}
if((n-1-ans)%2)
{
printf("Alice");
}
else printf("Bob");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3644kb
input:
4 1 2 2 3 3 4
output:
Alice
result:
ok "Alice"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
4 1 2 1 3 1 4
output:
Bob
result:
ok "Bob"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3760kb
input:
2 1 2
output:
Alice
result:
wrong answer 1st words differ - expected: 'Bob', found: 'Alice'