Pagini recente » Cod sursa (job #2127976) | Cod sursa (job #1558836) | Cod sursa (job #2423438) | Cod sursa (job #751685) | Cod sursa (job #2448058)
#include <fstream>
#include <vector>
#define NMAX 100010
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,x,y;
vector <pair <int,int> > v[NMAX];
vector<int >sol;
int viz[500010];
void euler(int nod)
{
while(!v[nod].empty())
{
int vecin = v[nod].back().first;
int poz = v[nod].back().second;
v[nod].pop_back();
if(!viz[poz])
{
viz[poz] = 1;
euler(vecin);
}
}
sol.push_back(nod);
}
int main()
{
f >> n >> m;
for(int i = 1; i <= m; ++i)
{
f >> x >> y;
v[x].push_back({y,i});
v[y].push_back({x,i});
}
for(int i = 1; i <= n; ++i)
if(v[i].size() & 1)
{
g << -1;
f.close();
g.close();
return 0;
}
euler(1);
for(int i = 0; i < sol.size() - 1; ++i)
g << sol[i] << ' ';
f.close();
g.close();
return 0;
}