Pagini recente » Borderou de evaluare (job #324994) | Cod sursa (job #2359541)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,i,x,y;
bool viz[500005];
vector<int> sol;
vector<pair<int,int> >G[100005];
void euler(int nc)
{
int vecin, muchie;
while(G[nc].size())
{
vecin=G[nc].back().first;
muchie=G[nc].back().second;
G[nc].pop_back();
if(viz[muchie]!=1)
{
viz[muchie]=1;
euler(vecin);
}
}
sol.push_back(nc);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(make_pair(y,i));
G[y].push_back(make_pair(x,i));
}
for(i=1;i<=n;i++)
if(G[i].size()%2==1)
{
g<<"-1";
return 0;
}
euler(1);
for(i=0;i<sol.size()-1;i++)
g<<sol[i]<<" ";
return 0;
}