Pagini recente » Cod sursa (job #444168) | Cod sursa (job #793836) | Cod sursa (job #1650560) | Cod sursa (job #1026281) | Cod sursa (job #2279227)
#include <bits/stdc++.h>
#define NM 100002
#define MM 500002
using namespace std;
struct edge
{
int u, v;
bool viz;
int other(int u)
{
return this->u + this->v - u;
}
};
int n, m;
edge edges[MM];
vector <int> gr[NM];
vector <int> ans;
void euler(int u)
{
for(auto e : gr[u])
if(edges[e].viz == 0)
{
edges[e].viz = 1;
euler(edges[e].other(u));
}
ans.push_back(u);
}
int main()
{
ifstream fin ("ciclueuler.in");
ofstream fout ("ciclueuler.out");
fin >> n >> m;
for(int i = 1; i <= m; i++)
{
fin >> edges[i].u >> edges[i].v;
edges[i].viz = 0;
}
for(int i = 1; i <= m; i++)
{
gr[edges[i].u].push_back(i);
gr[edges[i].v].push_back(i);
}
euler(1);
if(ans.size() != m + 1 || ans.front() != ans.back())
fout << "-1\n";
else
{
ans.pop_back();
for(auto i : ans)
fout << i << " ";
}
return 0;
}