Pagini recente » Cod sursa (job #1972583) | Cod sursa (job #2287170) | Cod sursa (job #1284725) | Cod sursa (job #1606783) | Cod sursa (job #1343346)
#include <fstream>
#include <vector>
#include <utility>
#define NX 100001
#define MX 500001
using namespace std;
int n,m;
vector< pair<int, int> > v[NX];
bool viz[MX];
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
void citire()
{
int i,x,y;
pair<int, int> muchie;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
muchie.first = y;
muchie.second = i;
v[x].push_back(muchie);
muchie.first = x;
v[y].push_back(muchie);
}
}
int grad_par()
{
int i;
for(i=1; i<=n; i++)
{
if(v[i].size() % 2 == 1) return 0;
}
return 1;
}
void hierholzer()
{
pair<int, int> e;
int i=1;
fout<<1<<' ';
while(!v[i].empty())
{
e = v[i].back();
v[i].pop_back();
if(!viz[e.second])
{
viz[e.second] = 1;
if(e.first == 1) break;
else
{
fout<<e.first<<' ';
i = e.first;
}
}
}
fout<<'\n';
}
int main()
{
citire();
if(grad_par() == 0)
{
fout<<-1<<'\n';
}
else
{
hierholzer();
}
fin.close(); fout.close();
return 0;
}