Pagini recente » Cod sursa (job #2427374) | Cod sursa (job #233301) | Cod sursa (job #861682) | Cod sursa (job #2715646) | Cod sursa (job #1201290)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
const int Nmax=20;
const int oo=1<<29;
const int Maxx=1000000;
int n,m;
int mat[Nmax][Nmax];
int puteri[20];
int dp[Maxx][Nmax];
vector<int>v[Nmax];
inline void Citire()
{
int i,j,x,y;
fin>>n>>m;
for (i=0;i<n;i++)
for (j=0;j<n;j++)
mat[i][j]=oo;
for (i=1;i<=m;i++)
{
fin>>x>>y;
v[y].push_back(x);
fin>>mat[x][y];
}
for (i=0;i<(1<<n);i++)
for (j=0;j<n;j++)
dp[i][j]=oo;
puteri[0]=1;
for (i=1;i<=19;i++) puteri[i]=2*puteri[i-1];
}
inline void DP()
{
int i,j;
const int aux=1<<n;
dp[1][0]=0;
for (i=0;i<aux;i++)
if (i&1)
{for (j=0;j<n;j++)
if (i&puteri[j])
for (vector<int>::iterator it=v[j].begin();it!=v[j].end();it++)
if (i&puteri[*it])
dp[i][j]=min(dp[i][j],dp[i-puteri[j]][*it]+mat[*it][j]);
}
}
inline void Afisare()
{
int i,minim=oo;
for (i=1;i<n;i++)
minim=min(minim,dp[puteri[n]-1][i]+mat[i][0]);
if (minim!=oo)
fout<<minim;
else fout<<"Nu exista solutie";
fout<<"\n";
}
int main()
{
Citire();
DP();
Afisare();
return 0;
}