anti-nim 博弈扩展(树形博弈)
详细见:http://wenku.baidu.com/view/e0c822d3240c844769eaeea8.html
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int head[1000],nxt[1000],ev[1000];
int edge=-1;
int fa[2000];
void addedge(int u,int v){
ev[++edge]=v;
nxt[edge]=head[u];
head[u]=edge;
}
int dfs(int u,int f){
int sg=0;
for(int i=head[u];i!=-1;i=nxt[i]){
int v=ev[i];
if(v!=f){
int tmp=dfs(v,u);
sg^=tmp+1;
}
}
return sg;
}
int main()
{
int n;
while(cin>>n)
{
int sg=0,fg=0;
for(int i=0;i<n;i++)
{
memset(head,-1,sizeof(head));
edge=-1;
int m;
cin>>m;
for(int j=1;j<m;j++)
{
int u,v;
scanf("%d%d",&u,&v);
addedge(u,v);
addedge(v,u);
}
int tmp=dfs(1,1);
sg^=tmp;
if(tmp>1) fg=1;
}
if(sg&&fg||!sg&&!fg) cout<<"PP"<<endl;
else cout<<"QQ"<<endl;
}
return 0;
}