Cod sursa(job #3312083)

Utilizator Gabriel_DaescuDaescu Gabriel Florin Gabriel_Daescu Data 26 septembrie 2025 08:59:22
Problema Ciclu hamiltonian de cost minim Scor 70
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.33 kb
#include <fstream>
#include <vector>
#define NMAX 20
#define INF (1LL<<60)
using namespace std;
ifstream  fin("hamilton.in");
ofstream fout("hamilton.out");
int N,M,ok,uz[NMAX],x[NMAX];
long long cmin,A[NMAX][NMAX];

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

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

    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 BACK(int k, long long cost)
{
    if(cost>=cmin)
    {
        return;
    }

    if(k==N)
    {
        if(A[x[N-1]][x[0]]!=-1)
        {
            if(cost+A[x[N-1]][x[0]]<cmin)
            {
                cmin=cost+A[x[N-1]][x[0]];
                ok=1;
            }
        }
        return;
    }

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

    }
}

int main()
{
    citire();

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

    if(ok)
    {
        fout<< cmin << "\n";
    }
    else
    {
        fout<< "Nu exista solutie";
    }
    fout<< "\n";

    return 0;
}