Mai intai trebuie sa te autentifici.
Cod sursa(job #2949955)
| Utilizator | Data | 2 decembrie 2022 13:33:32 | |
|---|---|---|---|
| Problema | Ciclu hamiltonian de cost minim | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
int n,m,i,j,x,y,z,b[19][19],a[19][1<<18];
int main()
{
f>>n>>m;
for(int i=0;i<n;i++)
for(int j=1;j<(1<<n);j++)
a[i][j]=b[i][j]=1e8;
for(int i=1;i<=m;i++)
{
f>>x>>y>>z;
b[x][y]=z;
}
for(int j=0;j<(1<<n);j++)
for(int i=0;i<n;i++)
if(j&(1<<i))
for(int k=0;k<n;k++)
if((1<<k)&j)
a[i][j]=min(a[i][j],b[k][i]+a[k][(j^(1<<i))]);
int smin=1e9;
for(int i=1;i<n;i++)
smin=min(smin,a[i][(1<<n)-1]+b[i][0]);
g<<smin;
return 0;
}
