Pagini recente » Cod sursa (job #2695757) | Cod sursa (job #397747) | Cod sursa (job #2859295) | Cod sursa (job #1929955) | Cod sursa (job #3199632)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#define NMAX 18
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin ("hamilton.in");
ofstream fout ("hamilton.out");
int n, m, c[(1<<NMAX)+2][NMAX], a[NMAX][NMAX];
vector<int> G[NMAX];
void citire()
{
fin >> n >> m;
for (int i = 1; i <= m; i++)
{
int x, y, c;
fin >> x >> y >> c;
G[y].push_back(x);
a[x][y] = c;
}
}
int main()
{
citire();
memset(c, 0x3f, sizeof(c));
c[1][0] = 0;
for (int i = 0; i < (1<<n); i++)
{
for (int j = 0; j < n; j++)
{
if (i & (1<<j) == 0) continue;
for (auto it : G[j])
{
if (i & (1<<it) == 0) continue;
c[i][j] = min(c[i][j], c[i^(1<<j)][it] + a[it][j]);
}
}
}
int sol = inf;
for (auto it : G[0])
sol = min(sol, c[(1<<n)-1][it] + a[it][0]);
if (sol == inf)
fout << "Nu exista solutie\n";
else fout << sol;
return 0;
}