Pagini recente » Cod sursa (job #790567) | Istoria paginii runda/oni2014_ziua_iii/clasament | Cod sursa (job #3223535) | Cod sursa (job #451216) | Cod sursa (job #2454538)
#include <vector>
#include <fstream>
using std::vector;
std::ifstream fin("hamilton.in");
std::ofstream fout("hamilton.out");
int main(){
int n,m;
fin >> n >> m;
vector<vector<int>> v(n), c(n, vector<int>(n, 1e9));
for(int i = 0; i < m; i++){
int x, y, cost;
fin >> x >> y >> cost;
v[y].push_back(x);
c[x][y] = cost;
}
vector<vector<int>> dp(1 << n, vector<int>(n, 1e9));
dp[1][0] = 0;
int nr = 1 << n;
for(int mask = 3; mask < nr; mask += 2)
for(int i = 1; i < n; i++)
if(mask & (1 << i))
for(int j : v[i])
dp[mask][i] = std::min(dp[mask][i], dp[mask ^ (1 << i)][j] + c[j][i]);
int sol = 1e9;
for(int i = 1; i < n; i++){
sol = std::min(sol, dp[nr-1][i]+c[i][0]);
}
if(sol == 1e9){
fout << "Nu exista solutie\n";
}else{
fout << sol<<"\n";
}
fout.close();
return 0;
}