Pagini recente » Cod sursa (job #1289273) | Cod sursa (job #1508021) | Cod sursa (job #767449) | Cod sursa (job #1594439) | Cod sursa (job #2376988)
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
vector<vector<pair<int, int>>> adjList;
vector<int> ciclu;
vector<bool> viz;
void euler(int x)
{
while (adjList[x].empty() == false)
{
auto e = adjList[x].back();
adjList[x].pop_back();
if (viz[e.second] == false)
{
viz[e.second] = true;
euler(e.first);
}
}
ciclu.push_back(x);
}
int main()
{
int n, m;
fin >> n >> m;
adjList.resize(n + 1);
viz.resize(m + 1, false);
int i = 0;
while (!fin.eof())
{
int a, b;
fin >> a >> b;
adjList[a].push_back({ b, i });
adjList[b].push_back({ a, i });
i++;
}
int flag = true;
for (auto const&a : adjList)
{
if (a.size() % 2 == 1)
{
flag = false;
break;
}
}
if (flag == false)
{
fout << -1;
return 0;
}
euler(1);
for (int i = 0; i < ciclu.size() - 1; i++)
fout << ciclu[i] << " ";
return 0;
}