Cod sursa(job #3343724)

Utilizator liadariaLia Daria Ostafi liadaria Data 28 februarie 2026 12:33:28
Problema Ciclu Eulerian Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <fstream>
#include <vector>
#define NMAX 100001
#define MMAX 500001
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
struct muchie{int x,i;};
int n,m;
bool sters[MMAX];
vector<muchie>G[NMAX];
vector<int>C;
void euler(int nod);
int main()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back({y,i});
        G[y].push_back({x,i});
    }
    for(i=1;i<=n;i++)
        if(G[i].size()%2) {fout<<-1; return 0;}
    for(i=1;i<=n;i++)
        if(G[i].size())
        {
            euler(i);
            break;
        }
    if(C.size()!=m+1) {fout<<-1;return 0;}
    for(i=0;i<C.size();i++) fout<<C[i]<<' ';
    return 0;
}
void euler(int nod)
{
    muchie m;
    while(!G[nod].empty())
    {
        m=G[nod].back(); G[nod].pop_back();
        if(!sters[m.i])
        {
            sters[m.i]=1;
            euler(m.x);
        }
    }
    C.push_back(nod);
}