Pagini recente » Cod sursa (job #289121) | Cod sursa (job #2584339) | Cod sursa (job #367534) | Cod sursa (job #2536803) | Cod sursa (job #2823470)
#include <bits/stdc++.h>
#define DAU ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PLEC return 0;
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
#define cin fin
#define cout fout
#define N 500005
vector < vector < pair < int , int > > > g;
int v[N], f[N], st, dr, i, x, y, k, n, m, ind, grad[N];
void fa(int nod)
{
for(auto t : g[nod])
{
if(f[t.second] == 0)
{
f[t.second] = 1;
fa(t.first);
}
}
v[++st] = nod;
}
int main()
{
DAU
cin >> n >> m;
g.resize(n+5);
for(int i = 1 ; i <= m ; i++)
{
cin >> x >> y;
grad[x]++;
grad[y]++;
g[x].push_back({y,i});
g[y].push_back({x,i});
}
for(int i = 1 ; i <= n ; i++)
{
if(grad[i]%2 == 1)
{
cout << "-1";
PLEC
}
}
fa(1);
for(int i = st ; i > 1 ; i--)cout << v[i] << " ";
PLEC
}