Pagini recente » Cod sursa (job #492197) | Cod sursa (job #2466951) | Cod sursa (job #3141432) | Cod sursa (job #1236870) | Cod sursa (job #2114647)
#include <fstream>
#include <vector>
#define nmax 100005
#define mmax 500005
using namespace std;
fstream f1("ciclueuler.in", ios::in);
fstream f2("ciclueuler.out", ios::out);
int n, m, grad[nmax], c[mmax], nrc, stiva[mmax], vf, viz[mmax];
vector <pair<int, int> > v[nmax];
void citire()
{
int i, x, y;
f1>>n>>m;
for(i=1; i<=m; i++)
{
f1>>x>>y;
v[x].push_back({y, i});
v[y].push_back({x, i});
grad[x]++;
grad[y]++;
}
}
int ok()
{
int i;
for(i=1; i<=n; i++)
if((grad[i]==0)||(grad[i]%2==1)) return 0;
return 1;
}
void afis()
{
int i;
for(i=1; i<nrc; i++)
f2<<c[i]<<' ';
}
void euler(int nod)
{
int vecin, muchie;
for(auto it=v[nod].begin(); it!=v[nod].end(); ++it)
{
vecin=(*it).first;
muchie=(*it).second;
if(!viz[muchie])
{
viz[muchie]=1;
euler(vecin);
}
}
nrc++;
c[nrc]=nod;
}
int main()
{
citire();
if(ok())
{
euler(1);
afis();
}
else f2<<-1;
return 0;
}