Cod sursa(job #1934462)

Utilizator sandupetrascoPetrasco Sandu sandupetrasco Data 21 martie 2017 15:45:47
Problema Ciclu Eulerian Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define mod 1000000007
 
using namespace std;

int n, m;
vector < int > V[100100];
int x[500500], y[500500];
bool v[500500];
string rs;

void euler(int node)
{
    for (auto it : V[node])
        if (!v[it]) v[it] = 1, euler(x[it] + y[it] - node);
    rs += node + '0';
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ifstream cin("ciclueuler.in");
    ofstream cout("ciclueuler.out");
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> x[i] >> y[i];
        V[x[i]].pb(i);
        V[y[i]].pb(i);
    }
    for (int i = 1; i <= n; i++) if (V[i].size() & 1) return cout << -1, 0;
    euler(1);
    reverse(s.begin(), s.end());
    cout << s;
    return 0;
}