Pagini recente » Cod sursa (job #2396557) | Cod sursa (job #3319842) | Cod sursa (job #1274982) | Cod sursa (job #1287959) | Cod sursa (job #3339143)
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n, m, x, y, i;
vector <pair<int, int>> v[100005];
vector <int> ans;
bool viz[500005];
void ciclu_euler()
{
stack<int> st;
st.push(1);
while(!st.empty())
{
int x=st.top();
if(v[x].size()==0)
{
ans.push_back(x);
st.pop();
}
else
{
while(!v[x].empty() && viz[v[x].back().second])
v[x].pop_back();
if(v[x].size())
{
viz[v[x].back().second]=1;
st.push(v[x].back().first);
v[x].pop_back();
}
}
}
}
int main()
{
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
v[x].push_back({y, i});
v[y].push_back({x, i});
}
for(i=1; i<=n; i++)
if(v[i].size()%2)
{
fout<<-1;
return 0;
}
ciclu_euler();
for(int i=0; i<ans.size()-1; i++)
fout<<ans[i]<<" ";
return 0;
}