Codeforces Round #646 (Div. 2)C. Game On Leaves（博弈）----题解

来源：http://codeforces.com/contest/1363/problem/C

Ayush and Ashish play a game on an unrooted tree consisting of n nodes numbered 1 to n. Players make the following move in turns:

Select any leaf node in the tree and remove it together with any edge which has this node as one of its endpoints. A leaf node is a node with degree less than or equal to 1.
A tree is a connected undirected graph without cycles.

There is a special node numbered x. The player who removes this node wins the game.

Ayush moves first. Determine the winner of the game if each player plays optimally.

Input
The first line of the input contains a single integer t (1≤t≤10) — the number of testcases. The description of the test cases follows.

The first line of each testcase contains two integers n and x (1≤n≤1000,1≤x≤n) — the number of nodes in the tree and the special node respectively.

Each of the next n−1 lines contain two integers u, v (1≤u,v≤n, u≠v), meaning that there is an edge between nodes u and v in the tree.

Output
For every test case, if Ayush wins the game, print “Ayush”, otherwise print “Ashish” (without quotes).

Examples
inputCopy
1
3 1
2 1
3 1
outputCopy
Ashish
inputCopy
1
3 2
1 2
1 3
outputCopy
Ayush
Note
For the 1st test case, Ayush can only remove node 2 or 3, after which node 1 becomes a leaf node and Ashish can remove it in his turn.

For the 2nd test case, Ayush can remove node 2 in the first move itself.

题意：
Ayush和Ashish玩游戏，他们每次删去一棵无根树的叶节点，最后谁删到x节点，谁就能获胜。（Ayush先手）求最后获胜是谁。

思路：
首先当特殊点入度为1或0时，一定是先手赢

当特殊点入度大于1时，当(n−1)%2==1,先手赢,否则后手赢

代码：

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int a[maxn];
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n, x;
		cin >> n >> x;
		memset(a, 0, sizeof(a));
		for (int i = 1; i < n; i++)
		{
			int l, r;
			cin >> l >> r;
			a[l]++, a[r]++;
		}
		if (a[x] == 1 || a[x] == 0)	
			cout << "Ayush" << endl;
		else if ((n - 1) % 2 == 1)	
			cout << "Ayush" << endl;
		else	
			cout << "Ashish" << endl;
	}
}