Pagini recente » Cod sursa (job #2928787) | Cod sursa (job #1220286) | Cod sursa (job #319323) | Cod sursa (job #950088) | Cod sursa (job #1201287)
#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 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;
}
inline void DP()
{
int i,j;
dp[1][0]=0;
for (i=0;i<(1<<n);i++)
for (j=0;j<n;j++)
if (i&(1<<j))
for (vector<int>::iterator it=v[j].begin();it!=v[j].end();it++)
if (i&(1<<(*it)))
dp[i][j]=min(dp[i][j],dp[i-(1<<j)][*it]+mat[*it][j]);
}
inline void Afisare()
{
int i,minim=oo;
for (i=1;i<n;i++)
minim=min(minim,dp[(1<<n)-1][i]+mat[i][0]);
fout<<minim<<"\n";
/*for (i=0;i<(1<<n);i++)
{
for (int j=0;j<=n;j++)
fout<<dp[i][j]<<" ";
fout<<"\n";
}*/
}
int main()
{
Citire();
DP();
Afisare();
return 0;
}