Pagini recente » Cod sursa (job #2120067) | Borderou de evaluare (job #1796732) | Cod sursa (job #223172) | simulare_de_oni_7 | Cod sursa (job #2547257)
#include <fstream>
#include <math.h>
#include <string.h>
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
const int INF = 2139062143;
int dp[20][262200];
int cost[20][20];
int n, m;
void init()
{
memset(dp, 127, sizeof(dp));
memset(cost, 127, sizeof(cost));
dp[0][1] = 0;
}
void citire()
{
f>>n>>m;
int x, y, c;
for(int i = 0; i<m; ++i)
{
f>>x>>y>>c;
cost[x][y] = c;
}
}
int calcCostMin(int i, int j)
{
if(dp[i][j] == INF)
for(int x = 0; x<n; ++x)
{
if(x != i && ((1<<x) & j) != 0 && cost[x][i] != INF)
dp[i][j] = min(dp[i][j], calcCostMin(x, (j^(1<<i))) + cost[x][i]);
}
return dp[i][j];
}
void solve()
{
int minim = INF;
for(int i = 0; i<n; ++i)
{
if(cost[i][0] != INF)
minim = min(minim, calcCostMin(i, (1<<n)-1) + cost[i][0]);
}
g<<minim;
}
int main()
{
init();
citire();
solve();
return 0;
}