Pagini recente » Cod sursa (job #392614) | Cod sursa (job #2425277) | Cod sursa (job #586890) | Cod sursa (job #2613336) | Cod sursa (job #2326949)
#include<bits/stdc++.h>
using namespace std;
ifstream in("ciclueuler.in");
ofstream out("ciclueuler.out");
int r[N],n,m;
vector<pair<int,int>> a[N];
bool v[5*N];
void dfs(int i, int j){
for(auto it:a[i]){
if(!v[it.s]){
v[it.s]=1;
dfs(it.f, it.s);
}
}
if(m--)
out<<i<<" ";
}
int main(){
int i,j,x,y;
in>>n>>m;
for(i=1; i<=m; ++i){
in>>x>>y;
a[x].push_back({y,i});
a[y].push_back({x,i});
++r[x], ++r[y];
}
for(i=1; i<=n; ++i)
if(r[i]%2){
out<<-1;
return 0;
}
dfs(1,0);
return 0;
}