Cod sursa(job #2174831)

Utilizator RaduMirceaAndreiRadu Mircea Andrei RaduMirceaAndrei Data 16 martie 2018 13:43:07
Problema Ciclu Eulerian Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.3 kb
# include <fstream>
# include <vector>
# include <stack>
# define DIM 100010
# define nod first
# define poz second
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
vector<pair<int,int> > Lista[DIM];
stack<int> s;
int d[DIM],Marcat[DIM],sol[10*DIM],f[10*DIM],n,m,x,y,i,nr,nc,nv;
void dfs(int nc){
    Marcat[nc]=1;
    for(int i=0;i<Lista[nc].size();i++){
        nv=Lista[nc][i].nod;
        if(!Marcat[nv])
            dfs(nv);
    }
}
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        d[x]++;
        d[y]++;
        Lista[x].push_back(make_pair(y,i));
        Lista[y].push_back(make_pair(x,i));
    }
    dfs(1);
    for(i=1;i<=n;i++)
        if(Marcat[i]==0||(d[i]%2==1)){
            fout<<"-1\n";
            return 0;
        }
    s.push(1);
    while(!s.empty()){
        nc=s.top();
        if(d[nc]==0){
            sol[++nr]=nc;
            s.pop();
            continue;
        }
        i=Lista[nc].size()-1;
        while(f[Lista[nc][i].poz]==1){
            i--;
            Lista[nc].pop_back();
        }
        f[Lista[nc][i].poz]=1;
        nv=Lista[nc][i].nod;
        s.push(nv);
        d[nc]--;
        d[nv]--;
    }
    for(i=1;i<nr;i++)
        fout<<sol[i]<<" ";
    return 0;
}