摘要:
经典的树形游戏的博弈题目给定一棵树,虽然是规定给定一棵根为1树,但数据给的是树枝,所以是无向的,坑爹啊View Code #include<iostream>#include<algorithm>#include<string>#include<vector>using namespace std;const int N = 100000+10;vector<int> g[N];bool vis[N];int w[N];void dfs(int u){ vis[u]=true; int size=g[u].size(); w[u]=0 阅读全文