Pagini recente » Cod sursa (job #2216352) | Cod sursa (job #1946769) | Cod sursa (job #1841479) | Cod sursa (job #1859157) | Cod sursa (job #2145327)
#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, nrl, l[mmax], gr[nmax], ok=1;
vector <int> v[nmax];
void euler(int nod)
{
while(v[nod].size()>0)
{
int vec=v[nod].back();
v[nod].pop_back();
for(auto it=v[vec].begin(); it!=v[vec].end(); ++it)
if(*it== nod) {v[vec].erase(it); break;}
euler(vec);
}
nrl++;
l[nrl]=nod;
}
int main()
{
int i, x, y;
f1>>n>>m;
for(i=1; i<=m; i++)
{
f1>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
if(x!=y) {gr[x]++; gr[y]++;}
}
for(i=1; i<=n; i++)
if(gr[i]%2==1) {ok=0; break;}
if(ok)
{
euler(1);
for(i=1; i<nrl; i++)
f2<<l[i]<<' ';
}
else f2<<-1;
return 0;
}