Cod sursa(job #3311894)

Utilizator Gabriel_DaescuDaescu Gabriel Florin Gabriel_Daescu Data 24 septembrie 2025 19:32:28
Problema Ciclu hamiltonian de cost minim Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.48 kb
#include <fstream>
#include <vector>
#define NMAX 20
#define INF (1<<30)
using namespace std;
ifstream  fin("hamilton.in");
ofstream fout("hamilton.out");
int N,M,ok,cmin,A[NMAX][NMAX],uz[NMAX],x[NMAX],best_sol[NMAX];

void citire()
{
    fin>>N>>M;

    int x,y,c;
    for(int i=0; i<N; i++)
    {
        for(int j=0; j<M; j++)
        {
            fin>>x>>y>>c;
            A[x][y]=c;
        }
    }
}

void prelucrare_sol()
{
    ok=1;

    int c=0;
    for(int i=1; i<N; i++)
    {
        c+=A[x[i-1]][x[i]];
    }
    c+=A[x[N-1]][x[0]];

    if(c<cmin)
    {
        cmin=c;
        for(int i=0; i<N; i++)
        {
            best_sol[i]=x[i];
        }
    }
}

void BACK(int k)
{
    for(int i=0; i<N; i++)
    {
       if(!uz[i] && A[x[k-1]][i])
       {
           uz[i]=1;
           x[k]=i;

           if(k==N-1)
           {
               if(A[i][x[0]])
               {
                   prelucrare_sol();
               }
           }
           else
           {
               BACK(k+1);
           }
           uz[i]=0;
       }

    }
}

int main()
{
    citire();

    cmin=INF;
    ok=0;
    uz[0]=1;
    x[0]=0;
    BACK(1);

    if(ok)
    {
        fout<< cmin << "\n";
        /*
        for(int i=0; i<N; i++)
        {
            fout<< best_sol[i] << " ";
        }
        */
    }
    else
    {
        fout<< "Nu exista solutie";
    }
    fout<< "\n";

    return 0;
}