Pagini recente » Cod sursa (job #1757396) | Cod sursa (job #696370) | Cod sursa (job #701769) | Cod sursa (job #2605945) | Cod sursa (job #2291921)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
const int Inf = 100000000;
using VI = vector<int>;
using VVI = vector<VI>;
int n, m, cmin = Inf, x, y, cost;
VVI w;
VVI G;
VVI c;
int main()
{
fin >> n >> m;
G = VVI(n);
w = VVI(n, VI(n, Inf));
for (int i = 1; i <= m; ++i)
{
fin >> x >> y >> cost;
G[x].push_back(y);
w[x][y] = cost;
}
for (int nod = 0; nod < n; ++nod)
{
c = VVI(1 << n, VI(n, Inf));
c[1][nod] = 0;
for (int i = 0; i < (1 << n); ++i)
for (int j = 0; j < n; ++j)
if (i & (1 << j))
for (int k = 0; k < n; ++k)
if (!(i & (1 << k)))
c[i | (1 << k)][k] = min(c[i | (1 << k)][k], c[i][j] + w[j][k]);
for (int j = 0; j < n; ++j)
if (j != nod)
cmin = min(cmin, c[(1 << n) - 1][j] + w[j][nod]);
}
fout << cmin;
fin.close();
fout.close();
return 0;
}