[博弈][思维]Just a joke 2021牛客多校第4场 F

Alice and Bob are playing a game.

At the beginning, there is an undirected graph G with n nodes.

Alice and Bob take turns to operate, Alice will play first. The player who can’t operate will lose the game.

Each turn, the player should do one of the following operations.

Select an edge of G and delete it from G.

Select a connected component of G which doesn’t have any loop, then delete it from G.

Alice and Bob are smart enough, you need to find who will win this game.

A connected component of an undirected graph is a set of nodes such that each pair of nodes is connected by a path, and other nodes in the graph are not connected to the nodes in this set.

For example, for graph with 33 nodes and edge set {(1,2),(2,3),(1,3)}.{1,2,3} is a connected component but {1,2},{1,3} are not.

输入描述：
The first line has two integers n,m.

Then there are mm lines, each line has two integers (u,v) describe an edge in G.

1≤n≤100

0≤m≤min(200,n(n−1)/2)

It’s guaranteed that graph G doesn’t have self loop and multiple edge.

输出描述：
Output the name of the player who will win the game.

示例1：
输入
3 1
1 2
输出
Bob

题意： 给出一个n点m边的图，两人在图上可以进行如下两操作：1. 删除一条边 2.删除一个无环的连通块，当对手不能删除时就赢了，询问谁会获胜。

分析： 看一下两种操作产生的影响，对于第一种操作会使边数减1，而第二种操作会使边数减k-1，点数减k，也就是点数+边数减去2*k-1，可以发现两种操作都会使点数+边数减少一个奇数，所以无论二者如何选择删除，一轮下来总会使点数+边数减少一个偶数，因此只需要看n+m的奇偶性，如果n+m是奇数那一定先手胜，如果n+m是偶数那一定后手胜。

具体代码如下：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
using namespace std;

signed main()
{
	int n, m;
	cin >> n >> m;
	if((n+m)&1) puts("Alice");
	else puts("Bob");
    return 0;
}