Pagini recente » Cod sursa (job #1032966) | Cod sursa (job #1932023) | Cod sursa (job #2154765) | Cod sursa (job #1933325) | Cod sursa (job #2368224)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n,m,vizm[500003];
vector<pair<int,int> >g[100003];
void euler()
{
for(int i=1;i<=n;i++)
if((int)g[i].size()%2)
{fout<<"-1";
break;}
else{
int st[100003];
int vf=1;
vector<int>sol;
st[vf]=1;
while(vf>0)
{
int nod=st[vf];
if(g[nod].size()==0)
{
sol.push_back(nod);
vf--;
}
else
{
int muchie=g[nod].back().second;
int to=g[nod].back().first;
g[nod].pop_back();
if(vizm[muchie]==0)
{
vizm[muchie]=1;
st[++vf]=to;
}
}
}
for(vector<int> :: iterator it=sol.begin();it!=sol.end()-1;it++)
fout<<*it<<" ";
}
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
g[x].push_back(make_pair(y,i));
g[y].push_back(make_pair(x,i));
}
euler();
}