Cod sursa(job #1943295)

Utilizator dorupopDoru Pop dorupop Data 28 martie 2017 14:56:04
Problema Ciclu Eulerian Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int ok,gr[100001],start,vf,st[500002],x,y,nod,n,m,i,k;
vector <pair <int , int > > G[100001];
bool viz[500002];
int main()
{
   f>>n>>m;
   for(i=1;i<=m;i++){
        f>>x>>y;
        gr[x]++;
        gr[y]++;
        G[x].push_back(make_pair(y,i));
        G[y].push_back(make_pair(x,i));
        start=x;

   }
   for(i=1;i<=n;i++)
   if(gr[i]%2==1){
        g<<-1;

        return 0;}
    st[++vf]=start;
    while(vf>=1){
        nod=st[vf];
           while(G[nod].size()>0&&viz[G[nod][0].second]==1){
                G[nod].erase(G[nod].begin());
           }
           if(G[nod].size()>0){
                st[++vf]=G[nod][0].first;
                viz[G[nod][0].second]=1;
                 G[nod].erase(G[nod].begin());

           }
        else
                    g<<st[vf--]<<" ";
    }
   /* if(k==m+1)
        for(i=1;i<k;i++)
            g<<euler[i]<<" ";
    else
        g<<-1;*/

    return 0;
}