Cod sursa(job #1170878)

Utilizator marinMari n marin Data 14 aprilie 2014 20:22:17
Problema Ciclu Eulerian Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 1.41 kb
#include <fstream>
#include <vector>
#include <cstring>

#define DIMN 100010
#define DIMM 500010

using namespace std;

ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");

vector < pair<int,int> > L[DIMN];
vector < pair<int,int> >::iterator it;

int D[DIMN];
int viz[DIMM];

int n, m, x, y, i, nod, number, ok;

void dfs(int nod) {
    viz[nod] = 1;

    for (vector < pair<int,int> >::iterator it = L[nod].begin(); it!= L[nod].end(); it++) {
        number++;
        if (viz[ it->first ] == 0) {
            dfs(it->first);
        }
    }
}

void euler(int nod) {
    for (vector < pair<int,int> >::iterator it = L[nod].begin(); it!= L[nod].end(); it++) {
        if (viz[ it->second ] == 0) {
            viz[it->second] = 1;
            euler(it->first);
        }
    }
    fout<<nod<<" ";
}

int main() {


    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        D[x]++;
        D[y]++;
        L[x].push_back(  make_pair(y,i)  );
        L[y].push_back(  make_pair(x,i)  );
    }

    for (nod=1;nod<=n;nod++)
        if (D[nod] != 0)
            break;

    dfs(nod);



    if (number != 2*m) {
        fout<<"-1\n";
        return 0;
    }

    ok = 1;
    for (i=1;i<=n;i++)
        if (D[i] % 2 == 1) {
            fout<<"-1\n";
            return 0;
        }

    memset(viz, 0, sizeof(viz));
    euler(nod);

    return 0;
}