Pagini recente » Cod sursa (job #640779) | Cod sursa (job #901227) | Cod sursa (job #2966135) | Cod sursa (job #2426000) | Cod sursa (job #2323220)
#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#define NMAX 100010
#define MMAX 500010
using namespace std;
int n, m, sterse;
vector<int> v[NMAX], sol;
int stiv[MMAX], st;
void citire()
{
scanf("%d %d", &n, &m);
int t1, t2;
for (int i = 1; i <= m; i++)
{
scanf("%d %d", &t1, &t2);
v[t1].push_back(t2);
v[t2].push_back(t1);
}
}
void euler()
{
for (int i = 1; i <= n; i++)
if (v[i].size()%2)
{
printf("-1");
return;
}
stiv[++st] = 1;
while (st > 0)
{
int top = stiv[st];
if (v[top].size() == 0)
{
sol.push_back(top);
st--;
}
else {
int next = v[top].back();
v[top].pop_back();
sterse++;
for (int i = 0; i < v[next].size(); i++)
if (v[next][i] == top)
{
v[next].erase(v[next].begin()+i);
break;
}
stiv[++st] = next;
}
}
if (sterse != m)
{
printf("-1");
return ;
}
for (int i = sol.size()-1; i > 0; i--)
printf("%d ", sol[i]);
}
int main()
{
freopen("ciclueuler.in", "r", stdin);
freopen("ciclueuler.out", "w", stdout);
citire();
euler();
return 0;
}