Pagini recente » Cod sursa (job #2095774) | Cod sursa (job #1156970) | Cod sursa (job #1777987) | Cod sursa (job #1017109) | Cod sursa (job #2734302)
#include <fstream>
#include <vector>
using namespace std;
const int M = 500000;
const int N = 100001;
struct muchie
{
int x, y;
bool folosit;
};
muchie e[M];
vector <int> a[N];
int c[M+1], ne;
void euler(int x)
{
for (auto i: a[x])
{
if (e[i].folosit)
{
continue;
}
e[i].folosit = true;
int y = e[i].x + e[i].y - x;
euler(y);
}
//c.push_back(x);
c[ne++] = x;
}
int main()
{
ifstream in("ciclueuler.in");
ofstream out("ciclueuler.out");
int n, m;
in >> n >> m;
for (int i = 0; i < m; i++)
{
in >> e[i].x >> e[i].y;
a[e[i].x].push_back(i);
a[e[i].y].push_back(i);
}
in.close();
euler(1);
//if (c.size() == m + 1)
if (ne == m + 1)
{
//c.erase(c.begin() + m);
ne--;
//for (auto x: c)
for (int i = 0; i < ne; i++)
{
int x = c[i];
out << x << " ";
}
}
else
{
out << -1;
}
out.close();
return 0;
}