Pagini recente » Cod sursa (job #275908) | Cod sursa (job #623657) | Cod sursa (job #600323) | Cod sursa (job #546167) | Cod sursa (job #3212389)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("hamilton.in");
ofstream cout ("hamilton.out");
int n,m;
int rasp = 2e9;
int d[20][20];
int dp[1<<18][20];
vector<int> g[20];
int calculare(int masca,int vf)
{
if(dp[masca][vf]!=-1)
return dp[masca][vf];
dp[masca][vf] = 2e9;
for(auto ult:g[vf])
{
if(((1<<ult) & masca)==0)
continue;
int nmasca = masca ^ (1<<vf);
dp[masca][vf] = min(dp[masca][vf],calculare(nmasca,ult)+d[ult][vf]);
}
return dp[masca][vf];
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,m;
cin >> n >> m;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
d[i][j] = rasp;
for(int i=0;i<(1<<n);i++)
for(int j=0;j<n;j++)
dp[i][j] = -1;
for(int i=1;i<=m;i++)
{
int x,y,c;
cin >> x >> y >> c;
d[x][y] = c;
g[y].push_back(x);
}
dp[1][0] = 0;
for(auto vf:g[0])
rasp = min( calculare((1<<n)-1,vf) + d[vf][0], rasp );
if(rasp==2e9)
{
cout << "Nu exista solutie";
return 0;
}
cout << rasp;
return 0;
}