Cod sursa(job #2552550)
Utilizator | Iliescu Alexia iliescualexia | Data | 20 februarie 2020 22:41:35 |
---|---|---|---|
Problema | Ciclu hamiltonian de cost minim | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.75 kb |
#include <iostream>
#include <fstream>
#define infinit 20000000
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
int i,j,n,m,cost,nodant,minn,a[20][20],d[262600][20],k;
int main()
{
fin>>n>>m;
int minn=infinit;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i==j)
{
a[i][j]=0;
}
else
{
a[i][j]=infinit;
}
}
}
for(i=1;i<=m;i++)
{
fin>>i>>j>>cost;
a[i][j]=cost;
}
for(i=3;i<=(1<<n)-1;i=i+2)
{
for(j=1;j<n;j++)
{
d[i][j]=infinit;
if((i&(1<<j))!=0)
{
nodant=i-(1<<j);
if(nodant==1)
{
if(a[0][j]!=0)
{
d[i][j]=a[0][j];
}
}
else
{
for(k=1;k<n;k++)
{
if((nodant&(1<<k))!=0&&a[k][j]!=0)
{
d[i][j]=min(d[i][j],d[nodant][k]+a[k][j]);
}
}
}
}
}
}
/* for(i=1;i<(1<<n);i++)
{
for(j=0;j<n;j++)
{
cout<<d[i][j]<<" ";
}
cout<<endl;
}*/
nodant=(1<<n)-1;
for(i=1;i<n;i++)
{
if(a[i][0]!=0&&d[nodant][i]!=infinit)
{
minn=min(minn,d[nodant][i]+a[i][0]);
}
}
if(minn<infinit)
{
fout<<minn;
}
else
{
fout<<"Nu exista solutie";
}
return 0;
}