Pagini recente » Cod sursa (job #1375261) | Cod sursa (job #1944800) | Cod sursa (job #393180) | Cod sursa (job #2531855) | Cod sursa (job #1426192)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream f("ciclueuler.in");
ofstream b("ciclueuler.out");
int a[500001];
vector <int> g[100001];
int dim=1;
void euler(int u)
{
int v;
// cout<<u;
while(g[u].size()!=0)
{
v=g[u].back();
g[u].pop_back();
for(int j=0;j<g[v].size();j++)
if(g[v][j]==u)
{
int aux=g[v][j];
g[v][j]=g[v][g[v].size()-1];
g[v].pop_back();
break;
}
euler(v);
}
a[dim]=u;
dim++;
}
int main()
{
int n,m,i,x,y,ok=1,o=1;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
for(i=1;i<=n;i++)
if(g[i].size()%2!=0)
ok=0;
if(ok==0)
b<<ok-1;
else
{
euler(1);
for(int j=1;j<dim;j++)
b<<a[j]<<" ";
}
}