Pagini recente » Cod sursa (job #969868) | Cod sursa (job #1681791) | Cod sursa (job #1732040) | Cod sursa (job #1171749) | Cod sursa (job #774639)
Cod sursa(job #774639)
#include <fstream>
#include <vector>
using namespace std;
int N, M, j = -1;
vector <pair <int, int> > v[100005];
int muchii[100005];
ofstream fout ("ciclueuler.out");
void Citire () {
ifstream fin ("ciclueuler.in");
fin >> N >> M;
int a, b;
for (int i = 0; i < M; i++)
{
fin >> a >> b;
v[a].push_back (make_pair (b, v[b].size ()));
v[b].push_back (make_pair (a, v[a].size () - 1));
muchii[a]++;
muchii[b]++;
}
fin.close ();
}
void Business () {
int nod = 1, a, b;
while (M) {
fout << nod << " ";
if (muchii[v[nod].back ().first] >= 2)
{
a = v[nod].back ().first;
b = v[nod].back ().second;
v[nod].pop_back ();
}
else
{
a = v[nod][0].first;
b = v[nod][0].second;
v[nod].erase (v[nod].begin ());
}
v[a].erase (v[a].begin () + b);
muchii[a]--;
muchii[nod]--;
M--;
nod = a;
}
/*for (int i = 1; i <= N; i++)
cout << v[i].size () << " ";
cout << "\n";*/
}
int main () {
Citire ();
for (int i = 1; i <= N; i++)
{
if (muchii[i] & 1)
{
fout << "-1";
fout.close ();
return 0;
}
}
Business ();
return 0;
}