Pagini recente » Cod sursa (job #2382458) | Cod sursa (job #822655) | Cod sursa (job #2465667) | Cod sursa (job #376960) | Cod sursa (job #1139621)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
vector<int> v[100001],w[100001];
int k,n,m,a,b,i,cic[500001],nr,nn;
int viz[500001];
void euler(int x)
{
for(int i=0;i<v[x].size();i++)
{
if(viz[w[x].at(i)]) continue;
nn--;
viz[w[x].at(i)]=1;
euler(v[x].at(i));
cic[++nr]=x;
}
}
int main()
{
f>>n>>m;
nn=m;
for(i=1;i<=m;i++)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
w[a].push_back(i);
w[b].push_back(i);
}
euler(1);
if(nn==0)
{
for(i=m;i>0;i--) g<<cic[i]<<" ";
g<<"\n";
}
else g<<"-1";
f.close();
g.close();
return 0;
}