Cod sursa(job #1698338)

Utilizator CrystyAngelDinu Cristian CrystyAngel Data 4 mai 2016 09:49:35
Problema Ciclu Eulerian Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

#define pb push_back

vector <int> v[100001];
int n,m;

void sterge(int x,int y)
{
    int i;
    for(i=0; i<v[x].size(); ++i)
        if(v[x][i]==y)
        {
            swap(v[x][i],v[x][v[x].size()-1]);
            v[x].pop_back();
            return ;
        }
}

int muchie_intoarcere(int n)
{
    int i;
    for(i=0; i<v[n].size(); ++i)
        if(v[n][i]<=n && v[v[n][i]].size()>1)
        return i;
    for(i=0; i<v[n].size(); ++i)
        if(v[v[n][i]].size()>1)
        return i;
    return 0;
}

void fleury()
{
    int n,p,x;
    n=1;
    while(m)
    {
        printf("%d ",n);

        p=muchie_intoarcere(n);

        x=v[n][p];
        sterge(n,x);
        sterge(x,n);
        --m;

        n=x;
    }
}

int main()
{
    freopen("ciclueuler.in","r",stdin);
    freopen("ciclueuler.out","w",stdout);

    int i,a,b;

    scanf("%d%d",&n,&m);

    for(i=0; i<m; ++i)
    {
        scanf("%d%d",&a,&b);
        v[a].pb(b);
        v[b].pb(a);
    }

    int ok=1;
    for(i=1; i<=n; ++i)
        if(v[i].size()%2==1)
        {
            ok=0;
            printf("-1");
            break;
        }

    if(ok)
        fleury();
}