Pagini recente » Cod sursa (job #3212895) | Cod sursa (job #612919) | Cod sursa (job #663868) | Cod sursa (job #1949566) | Cod sursa (job #1134465)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
const int MAXN = 100009;
int N, M, sol[MAXN*5], l;
vector < int > ind[MAXN];
bool used[MAXN*5],viz[MAXN];
struct muchii
{
int unu, doi;
} v[MAXN*5];
void citire()
{
fin >> N >> M;
for (int i = 1; i <= M; ++i)
{
int x, y;
fin >> x >> y;
v[i].unu = x, v[i].doi = y;
ind[x].push_back(i);
ind[y].push_back(i);
}
}
inline int varf(int nod, int val)
{
if ( v[nod].unu == val )
return v[nod].doi;
return v[nod].unu;
}
void conex(int nod){
viz[nod]=true;
for(unsigned i=0;i<ind[nod].size();i++){
int x=varf(ind[nod][i],nod);
if(viz[x]==false)
conex(x);
}
}
inline void ciclu_euler(int tata)
{
int L = ind[tata].size();
for (int i = 0; i < L; ++i)
{
int indice = ind[tata][i];
if ( !used[indice] )
{
used[indice] = true;
int fiu = varf(indice, tata);
ciclu_euler(fiu);
}
}
//sol[++l] = tata;
++l;
if(l<=M)
fout<<tata<<" ";
}
int main ()
{
citire();
int aux = 1;
conex(1);
for(int i=1;i<=N;i++)
if(viz[i]==false || ind[i].size()%2==1)
aux=0;
if(aux==0)
fout<<"-1";
else
ciclu_euler(1);
fin.close();
fout.close();
return 0;
}