Pagini recente » Cod sursa (job #1574030) | Cod sursa (job #3138686) | Cod sursa (job #2901067) | Cod sursa (job #2583805) | Cod sursa (job #3239853)
#include <bits/stdc++.h>
#define NMAX 100100
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
deque<int>q, ans;
vector<pair<int,int>>v[NMAX];
int use[NMAX*5];
void euler()
{
int x,y;
q.push_back(1);
while(!q.empty())
{
x=q.back();
while(v[x].empty()==false && use[v[x].back().first]!=0)
v[x].pop_back();
if(v[x].size()==0)
{
q.pop_back();
ans.push_back(x);
}
else
{
use[v[x].back().first]=1;
q.push_back(v[x].back().second);
v[x].pop_back();
}
}
}
int n,m, x, y;
int main()
{
fin>>n>>m;
for(int i=1;i<=m;++i)
{
fin>>x>>y;
v[x].push_back({i,y});
v[y].push_back({i,x});
}
for(int i=1;i<=n;++i)
if(v[i].size()%2==1)
{
fout<<"-1";
return 0;
}
euler();
ans.pop_back();
for(auto i:ans)
fout<<i<<" ";
return 0;
}