Pagini recente » Cod sursa (job #1376779) | Cod sursa (job #1362045) | Cod sursa (job #1853566) | Cod sursa (job #1551497) | Cod sursa (job #3203338)
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
const char nl = '\n';
const char sp = ' ';
const int inf = 0x3f3f3f3f;
const int mod = 666013;
const char out[2][4]{ "NO", "YES" };
#define all(a) a.begin(), a.end()
using ll = long long;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
const int nmax = 1e5;
int n, m;
multiset<int> g[nmax + 5];
int dg[nmax + 5];
vector<int> path;
void add(int u, int v) {
g[u].insert(v);
g[v].insert(u);
}
void remove(int u, int v) {
g[u].erase(g[u].find(v));
g[v].erase(g[v].find(u));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
fin >> n >> m;
for (int i = 1; i <= m; ++i) {
int u, v;
fin >> u >> v;
add(u, v);
dg[u]++, dg[v]++;
}
if (!all_of(dg + 1, dg + n + 1, [&](int x) { return x % 2 == 0; })) {
fout << -1;
}
path.reserve(m);
stack<int> st;
st.push(1);
while (st.size()) {
int u = st.top();
if (g[u].empty()) {
fout << u << sp;
st.pop();
}
else {
int v = *g[u].begin();
remove(u, v);
st.push(v);
}
}
}