Pagini recente » Cod sursa (job #1457605) | Cod sursa (job #362199) | Cod sursa (job #775104) | Cod sursa (job #1068393) | Cod sursa (job #2554644)
#include <iostream>
#include <cstdio>
#include <vector>
#define NMAX 100000
#define MMAX 500000
using namespace std;
char marcat[MMAX+2];
int stiva[MMAX+2];
struct muchie
{
int nod,ind;
};
vector <muchie> v[NMAX+2];
vector <int> rez;
int main()
{
freopen("ciclueuler.in","r",stdin);
freopen("ciclueuler.out","w",stdout);
int n,i,m,x,y,varf,gasit;
muchie a;
cin>>n>>m;
for(i=1; i<=m; i++)
{
cin>>x>>y;
a.ind=i;
a.nod=x;
v[y].push_back(a);
a.nod=y;
v[x].push_back(a);
}
for(i=1; i<=n; i++)
if(v[i].size()%2==1)
{
cout<<"-1";
return 0;
}
int top=0;
stiva[++top]=1;
while(top>0)
{
varf=stiva[top];
gasit=0;
for(i=(v[varf].size()-1); i>=0 && !gasit; i--)
if(!marcat[v[varf][i].ind])
{
marcat[v[varf][i].ind]=1;
gasit=1;
stiva[++top]=v[varf][i].nod;
}
else
v[varf].pop_back();
if(gasit==0)
{
rez.push_back(stiva[top]);
top--;
}
}
if(rez.size()!=m+1)
cout<<-1;
else for(i=0;i<rez.size()-1;i++)
cout<<rez[i]<<' ';
return 0;
}