显示代码纯文本
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int SIZEN=100010;
int N,M;
vector<int> c[SIZEN];
int deg[SIZEN]={0};
queue<int> Q;
bool del[SIZEN]={0};
void work(void)
{
for(int i=1;i<=N;i++)
{
if(deg[i]<3) Q.push(i),del[i]=true;
}
while(!Q.empty())
{
int x=Q.front();Q.pop();
for(int i=0;i<c[x].size();i++)
{
int u=c[x][i];
deg[u]--;
if(!del[u]&°[u]<3)
{
del[u]=true;
Q.push(u);
}
}
}
int ans=0;
for(int i=1;i<=N;i++)
{
if(!del[i]) ans^=i;
}
printf("%d\n",ans);
}
void read(void)
{
scanf("%d%d",&N,&M);
int a,b;
for(int i=1;i<=M;i++)
{
scanf("%d%d",&a,&b);
c[a].push_back(b);
c[b].push_back(a);
deg[a]++;
deg[b]++;
}
}
int main(void)
{
freopen("asm_game.in","r",stdin);
freopen("asm_game.out","w",stdout);
read();
work();
return 0;
}