Pagini recente » Cod sursa (job #2338986) | Cod sursa (job #863141) | Cod sursa (job #1601270) | Cod sursa (job #702686) | Cod sursa (job #1255036)
#include<cstdio>
#include<list>
using namespace std;
list<int> a[100002];
int i, st[100002], g[100002], x, y, n, m, v;
void sterge(int p1, int p2){
list<int>::iterator it;
g[p1]--; g[p2]--;
a[p1].pop_front();
for (it=a[p2].begin();it!=a[p2].end();it++) {
if (*it==p1) {a[p2].erase(it); break;}
}
}
void euler(int poz){
list<int>::iterator it;
int p2;
while (!a[poz].empty()) {
p2=a[poz].front(); st[++st[0]]=p2; sterge(poz, p2); poz=p2;
}
}
int main(){
freopen("ciclueuler.in","r",stdin);
freopen("ciclueuler.out","w",stdout);
scanf("%d%d", &n, &m);
for (i=1;i<=m;i++) {
scanf("%d%d", &x, &y); a[x].push_back(y); a[y].push_back(x); g[x]++; g[y]++;
}
for (i=1;i<=n;i++) if ((g[i]%2==1)||(g[i]==0)) {printf("-1\n"); return 0;}
v=1; st[0]=1; st[1]=1;
while (st[0]!=0) {
euler(v);
printf("%d ", st[st[0]]); v=st[st[0]]; st[st[0]]=0; st[0]--;
}
return 0;
}