Pagini recente » Cod sursa (job #1194192) | Cod sursa (job #1231091) | Cod sursa (job #2095409) | Cod sursa (job #516898) | Cod sursa (job #2280550)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ciclueuler.in");
ofstream out("ciclueuler.out");
vector < pair <int,int> > v[100001];
int n,m,x,k,a[500001],i,y;
void ciclu_eulerian(int x)
{ while(!v[x].empty())
{ int p=v[x].back().second,q=v[x].back().first;
v[x].pop_back();
if(!a[p])
{ a[p]=1;
ciclu_eulerian(q);
}
}
a[k++]=x;
}
int main()
{ in>>n>>m;
for(int i=1;i<=m;i++)
{ in>>x>>y;
v[x].push_back({y,i});
v[y].push_back({x,i});
}
for(int i=1;i<=n;i++)
if(v[i].size()%2!=0)
{ out<<"-1";
in.close();
out.close();
return 0;
}
ciclu_eulerian(1);
for(int i=1;i<k;i++)
out<<a[i]<<" ";
in.close();
out.close();
return 0;
}