Pagini recente » Cod sursa (job #3239044) | Cod sursa (job #799826) | Cod sursa (job #2990605) | Cod sursa (job #343959) | Cod sursa (job #3002408)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
struct muchie{
int nod, nr;
};
vector <muchie> l[100001];
int grad[100001], viz[500001], poz[100001], sol[500001], st[500001];
int main()
{
int n, m, i, x, y;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
l[x].push_back({y, i});
l[y].push_back({x, i});
grad[x]++;
grad[y]++;
}
for(i=1;i<=n;i++)
{
if(grad[i]%2==1)
{
fout<<-1;
return 0;
}
}
int k=0, top=1;
st[top]=1;
while(top)
{
int nod=st[top];
if(grad[nod]==0)
{
top--;
k++;
sol[k]=nod;
}
else
{
for(i=poz[nod];i<l[nod].size();i++)
{
if(viz[l[nod][i].nr]==0)
{
viz[l[nod][i].nr]=1;
grad[nod]--;
grad[l[nod][i].nod]--;
poz[nod]=i;
top++;
st[top]=l[nod][i].nod;
break;
}
}
}
}
if(k-1!=m)
{
fout<<-1;
return 0;
}
for(i=k;i>=2;i--)
{
fout<<sol[i]<<" ";
}
}