Pagini recente » Cod sursa (job #1113175) | Cod sursa (job #2998874) | Cod sursa (job #2887923) | Cod sursa (job #2493479) | Cod sursa (job #1307050)
#include<fstream>
#include<vector>
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
int n,m,x,y,c,i,j,d[280000][20],sol;
vector<pair<int,int> > v[29];
int rez(int config,int x)
{
if(d[config][x]!=-1)
return d[config][x];
d[config][x]=INF;
for(int i=0;i<v[x].size();++i)
if(config&(1<<v[x][i].first))
{
if(v[x][i].first!=0||(v[x][i].first==0&&config==1+(1<<x)))
d[config][x]=min(d[config][x],rez(config^(1<<x),v[x][i].first)+v[x][i].second);
}
return d[config][x];
}
int main()
{
f>>n>>m;
for(i=1;i<=m;++i)
{
f>>x>>y>>c;
v[x].push_back(make_pair(y,c));
}
for(i=1;i<=262145;++i)
for(j=0;j<=n;++j)
d[i][j]=-1;
d[1][0]=0;
sol=INF;
for(i=0;i<v[0].size();++i)
sol=min(sol,rez((1<<n)-1,v[0][i].first)+v[0][i].second);
if(sol!=INF)
g<<sol<<'\n';
else
g<<"Nu exista solutie";
return 0;
}