Submission #2708843

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100005;

struct node {
	int to, next;
} edge[MAXN*2];
int head[MAXN], top = 0;
inline void push(int i, int j)
{ edge[++top] = (node) {j, head[i]}, head[i] = top; }

int n, x, y;

int dp[MAXN];

void dfs(int nd, int f)
{
	for (int i = head[nd]; i; i = edge[i].next) {
		int to = edge[i].to;
		if (to == f) continue;
		dfs(to, nd), dp[nd] ^= dp[to]+1;
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i = 2; i <= n; i++) {
		cin >> x >> y;
		push(x, y), push(y, x);
	}
	dfs(1, 0);
	if (dp[1] != 0) cout << "Alice" << endl;
	else cout << "Bob" << endl;
	return 0;
}

Submission Info

Judge Result