Pagini recente » Cod sursa (job #1585379) | Cod sursa (job #1930183) | Cod sursa (job #1179906) | Cod sursa (job #1960838) | Cod sursa (job #2176098)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n,m,x,y,gr[100001],ok,viz[500001];
vector<pair<int,int>> v[100001];
vector<int> rasp;
stack<int> s;
int main()
{
fin>>n>>m;
for (int i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back({y,i});
v[y].push_back({x,i});
gr[x]++;
gr[y]++;
}
for (int i=1;i<=n;i++)
if (gr[i]%2==1||gr[i]==0)
ok=1;
if (ok==0)
{
s.push(1);
while (!s.empty())
{
int i=s.top();
if (v[i].size())
{
x=v[i].back().first;
y=v[i].back().second;
v[i].pop_back();
if (!viz[y])
{
viz[y]=1;
s.push(x);
}
}
else
{
s.pop();
rasp.push_back(i);
}
}
}
if (ok==0)
for (int i=0;i<rasp.size()-1;i++)
fout<<rasp[i]<<" ";
else fout<<-1;
return 0;
}