QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #679136 | #7786. Graft and Transplant | surenjamts# | WA | 0ms | 3632kb | C++17 | 458b | 2024-10-26 16:57:37 | 2024-10-26 16:57:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
vector <int> adj[247];
signed main(){
int n, a, b;
cin >> n;
for(int i = 1; i < n; i ++ ){
cin >> a >> b;
adj[a].pb( b );
adj[b].pb( a );
}
int leaf = 0;
for(int i = 1; i <= n; i ++ ){
if( adj[i].size() == 1 )
leaf ++;
}
if( (n-leaf)%2 == 0 ){
cout << "Alice\n";
}else
cout << "Bob\n";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3524kb
input:
4 1 2 2 3 3 4
output:
Alice
result:
ok "Alice"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
4 1 2 1 3 1 4
output:
Bob
result:
ok "Bob"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3632kb
input:
2 1 2
output:
Alice
result:
wrong answer 1st words differ - expected: 'Bob', found: 'Alice'