Cod sursa(job #1164491)

Utilizator sergiunascaSergiu Nasca sergiunasca Data 2 aprilie 2014 09:14:33
Problema Ciclu Eulerian Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 1.59 kb
#include <fstream>
#include <vector>
#include <utility>
#include <bitset>
#define NMax 100003
#define Iter std::vector<>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
std::vector<int> G[NMax],Stiva;
std::bitset<NMax> viz;
int n,m,nod1,nod2,contor,contornod[NMax],x,y;
void euler(int x)
{
    for(int i=0;i<G[x].size();++i)
    {
        if(viz[G[x][i]]==0)
        {
            viz[G[x][i]] = 1;
            euler(G[x][i]);
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        fin>>nod1>>nod2;
        G[nod1].push_back(nod2);
        G[nod2].push_back(nod1);
        ++contornod[nod1];++contornod[nod2];
    }
    for(int i=1;i<=n;++i)
    {
        if(contornod[i]==1)
        {
            fout<<"-1";
            return 0;
        }
    }
    Stiva.push_back(1);
    viz[1] = 1;
    euler(1);
    for(int i=1;i<=n;++i)
    {
        if(viz[i]==0)
        {
            fout<<"-1";
            return 0;
        }
    }
    while(!Stiva.empty())
    {
        x = Stiva.back();
        if(!G[x].empty())
        {
            y = G[x].back();
            G[x].pop_back();
            for(int i=0;i<G[y].size();++i)
            {
                if(G[y][i]==x)
                {
                    G[y][i] = G[y].back();
                    break;
                }
            }
            G[y].pop_back();
            Stiva.push_back(y);
        }
        else
	    {
	        if(Stiva.size()>1)fout<<Stiva.back()<<" ";
	        Stiva.pop_back();
	    }
    }
    return 0;
}