Pagini recente » Cod sursa (job #832023) | Cod sursa (job #831767) | Istoria paginii runda/o__o/clasament | Cod sursa (job #843844) | Cod sursa (job #2476021)
#include <fstream>
#include <vector>
#include <cstring>
#define inf 127
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
int n,m,i,j,x,y,c,s,snext,vecin,cost,sol,d[18][(1<<18)],w[18];
vector< pair<int,int> > L[18];
int main() {
fin>>n>>m;
for (i=0;i<n;i++) {
for (j=0;j<(1<<n);j++)
d[i][j]=inf;
w[i]=inf;
}
for (i=1;i<=m;i++) {
fin>>x>>y>>c;
L[x].push_back({y,c});
if (y==0)
w[x]=c;
}
sol=inf, d[0][1]=0;
for (s=1;s<(1<<n);s+=2) {
for (i=0;i<n;i++) {
if (d[i][s]!=inf) {
for (j=0;j<L[i].size();j++) {
vecin=L[i][j].first;
cost=L[i][j].second;
if (!(s&(1<<vecin))) {
snext=s+(1<<vecin);
d[vecin][snext]=min(d[vecin][snext],d[i][s]+cost);
}
}
}
}
}
for (i=1;i<n;i++) {
if (w[i]!=inf&&d[i][(1<<n)-1]!=inf)
sol=min(sol,d[i][(1<<n)-1]+w[i]);
}
if (sol!=inf)
fout<<sol;
else
fout<<"Nu exista solutie";
return 0;
}