Pagini recente » Cod sursa (job #511799) | Cod sursa (job #45152) | Cod sursa (job #970451) | Cod sursa (job #1755458) | Cod sursa (job #1944078)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int ok,start,vf,st[500002],x,y,nod,n,m,i,k;
vector <pair <int , int > > G[100001];
bool viz[500002];
int main()
{
f>>n>>m;
for(i=1;i<=m;i++){
f>>x>>y;
G[x].push_back(make_pair(y,i));
G[y].push_back(make_pair(x,i));
start=x;
}
for(i=1;i<=n;i++)
if(G[i].size()%2==1){
g<<-1;
return 0;}
st[++vf]=start;
while(vf>=1){
nod=st[vf];
while(G[nod].size()>0&&viz[G[nod].back().second]==1){
G[nod].pop_back();
}
if(G[nod].size()>0){
st[++vf]=G[nod].back().first;
viz[G[nod].back().second]=1;
G[nod].pop_back();
}
else
g<<st[vf--]<<" ";
}
/*if(k==m+1)
for(i=1;i<k;i++)
g<<euler[i]<<" ";
else
g<<-1;*/
return 0;
}