Pagini recente » Cod sursa (job #2402592) | Cod sursa (job #131657) | Cod sursa (job #1998116) | Cod sursa (job #2316849) | Cod sursa (job #2318992)
#include <fstream>
#include <vector>
#define nmax 100000
#define mmax 500000
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n,m,a[mmax+5],k=0;
bool viz[mmax+5];
vector < pair < int,int > > v[nmax+5];
void euler(int x)
{
int poz,vecin;
while(!v[x].empty())
{
poz=v[x].back().second;
vecin=v[x].back().first;
v[x].pop_back();
if(!viz[poz])
{
viz[poz]=1;
euler(vecin);
}
}
a[++k]=x;
}
int main()
{
int x,y;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(make_pair(y,i));
v[y].push_back(make_pair(x,i));
}
for(int i=0;i<n;i++)
if(v[i].size()%2)
{
fout<<-1<<"\n";
return 0;
}
euler(1);
for(int i=1;i<k;i++)
fout<<a[i]<<" ";
return 0;
}