Pagini recente » Cod sursa (job #1569529) | Clasament Teme ACM Unibuc 2013 | Cod sursa (job #1884421) | Cod sursa (job #2337539) | Cod sursa (job #2537728)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
vector <pair <int,int> > G[100003];
int nr,v[500003];
bool uz[500003];
void fct( int nod);
int main()
{
int n,i,m,x,y;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
G[x].push_back({y,i});
G[y].push_back({x,i});
}
fct(1);
if(nr!=m+1) fout<<-1;
else for(i=1;i<nr;i++)
fout<<v[i]<<" ";
return 0;
}
void fct( int nod)
{
for (int i=0; i<G[nod].size(); i++)
if (!uz[G[nod][i].second])
{
uz[G[nod][i].second]=1;
fct(G[nod][i].first);
}
v[++nr]=nod;
}