代码如下
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5,maxm=1e5+5;
vector<int>vec[maxn];
unordered_map<int,int>ump;
bool vis[maxm];
int deg[maxn],path[maxm],n,m,fa[maxn],lenP;
void dfs(int now){
int i,lenV,next,id;
if(!deg[now]){
path[++lenP]=now;return;
}
lenV=vec[now].size();
for (i=0;i<lenV;i++){
next=vec[now][i];
if(now<next)id=now*10001+next;
else id=next*10001+now;
if(vis[ump[id]])continue;
vis[ump[id]]=true;
deg[now]--;deg[next]--;
dfs(next);
}
path[++lenP]=now;
}
void init(int maxx){
for (int i=1;i<=maxx;i++)fa[i]=i;
}
int _find(int x){
if(fa[x]==x)return x;
return fa[x]=_find(fa[x]);
}
void Merge(int x,int y){
fa[x]=y;
}
int main(){
int i,a,b,id,cnt,fa,fb,blockNum;
while(scanf("%d%d",&n,&m)!=EOF){
for (i=0;i<=10000;i++)vec[i].clear();
ump.clear();cnt=0;blockNum=n;
memset(deg,0,sizeof(deg));lenP=0;
memset(vis,0,sizeof(vis));
init(n);
for (i=1;i<=m;i++){
scanf("%d%d",&a,&b);
if(a>b)swap(a,b);
fa=_find(a);fb=_find(b);
if(fa!=fb)blockNum--,Merge(fa,fb);
deg[a]++;deg[b]++;
id=a*10001+b;
ump[id]=i;
vec[a].push_back(b);vec[b].push_back(a);
}
if(blockNum!=1){
printf("-1\n");continue;
}
for (i=1;i<=n;i++)sort(vec[i].begin(),vec[i].end());
for (i=1;i<=n;i++)if(deg[i]&1)cnt++;
if(!cnt){
dfs(1);
for (i=lenP;i>=1;i--){
printf("%d",path[i]);
if(i!=1)printf(" ");
}printf("\n");
}
else if(cnt==2){
if(deg[1]&1){
dfs(1);
for (i=lenP;i>=1;i--){
printf("%d",path[i]);
if(i!=1)printf(" ");
}printf("\n");
}
else printf("-1\n");
}
else printf("-1\n");
}
return 0;
}