Pagini recente » Cod sursa (job #893761) | Utilizatori inregistrati la Infoarena Cup 2013 | Cod sursa (job #3177207) | Cod sursa (job #2121135) | Cod sursa (job #2543127)
#include<iostream>
#include<fstream>
#include<vector>
#define mp make_pair
using namespace std;
int grade[100010],n; ofstream o("ciclueuler.out");
vector <pair<int,int> > v[100010];
bool viz[500010];
void citire(){
ifstream f("ciclueuler.in");
int m,x,y,i; f>>n>>m;
for(i=1;i<=m;i++){
f>>x>>y;
v[x].push_back(mp(i,y));
v[y].push_back(mp(i,x));
}
f.close();
}
void dfs(int k){
while(v[k].size()){
pair <int,int> e=v[k].back();
v[k].pop_back();
if(!viz[e.first]){
viz[e.first]=1;
dfs(e.second);
}
}
o<<k<<" ";
}
int main(){
citire();
int i;
for(i=1;i<=n;i++)
if(((v[i].size())&1)>0){
o<<-1;
return 0;
}
dfs(1);
return 0;
}