Cod sursa(job #2384728)

Utilizator baranceanuBaranceanu Vlad baranceanu Data 21 martie 2019 09:51:04
Problema Ciclu Eulerian Scor 60
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.22 kb
#include <fstream>
#include <vector>
#define NMAX 100005
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n,m;
struct nod{int varf,uz;};
vector <nod> g[NMAX];
vector <int> a;
void citire();
void rezolvare();
void dfs(int k);
int main()
{
    citire();
    rezolvare();
    return 0;
}
void citire()
{
    int i;
    nod a,b;
    a.uz=0;
    b.uz=0;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a.varf>>b.varf;
        g[a.varf].push_back(b);
        g[b.varf].push_back(a);
    }
}
void rezolvare()
{
    int i;
    for(i=1;i<=n;i++)
    {
        if(g[i].size())
        {
            dfs(i);
            break;
        }
    }
    for(i=0;i<a.size()-1;i++)
    {
        fout<<a[i]<<' ';
    }
}
void dfs(int k)
{
    int i,j,l;
    for(i=0;i<g[k].size();i++)
    {
        if(g[k][i].uz==0)
        {
            g[k][i].uz=1;
            l=g[k][i].varf;
            for(j=0;j<g[l].size();j++)
            {
                if(g[l][j].varf==k&&g[l][j].uz==0)
                {
                    g[l][j].uz=1;
                    break;
                }
            }
            dfs(l);
        }
    }
     a.push_back(k);
}