Pagini recente » Cod sursa (job #1145436) | Cod sursa (job #2909948) | Cod sursa (job #2801671) | Cod sursa (job #1754024) | Cod sursa (job #1366574)
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
typedef std::vector< std::pair< int, int > >::iterator iter;
const int MAXN = 100005;
const int MAXM = 500005;
std::ifstream f("ciclueuler.in");
std::ofstream g("ciclueuler.out");
int n, m;
std::vector< std::pair< int, int > > G[MAXN];
std::bitset<MAXM> viz;
bool iseuler()
{
for (int i = 1; i <= n; i++) {
if (G[i].size() % 2 != 0) {
return false;
}
}
return true;
}
void euler(int nd)
{
for (iter it = G[nd].begin(); it != G[nd].end(); it++) {
if (viz[it->second] == true) {
continue;
}
viz[it->second] = true;
euler(it->first);
g << nd << ' ';
}
}
int main()
{
f >> n >> m;
for (int i = 1, x, y; i <= m; i++) {
f >> x >> y;
G[x].push_back(std::make_pair(y, i));
G[y].push_back(std::make_pair(x, i));
}
if (!iseuler()) {
std::cout << -1 << std::endl;
f.close();
g.close();
return 0;
}
euler(1);
g << std::endl;
//system("pause");
f.close();
g.close();
return 0;
}