Cod sursa(job #2232940)

Utilizator shantih1Alex S Hill shantih1 Data 21 august 2018 17:57:12
Problema Ciclu hamiltonian de cost minim Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <iostream>
#include <fstream>
#define inf (1<<30)

using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");

int n,m,a,ci,i,j,l,k,rez;
int cm[20][20];

int main() {
	
	fin>>n>>m;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			cm[i][j]=inf;
	
	while(m--)
	{
		fin>>a>>k;
		fin>>cm[a][k];
	}
	
	l=(1<<n)-1;
	int dp[n][l];
	int id[n][l];
	for(a=0;a<n;a++)
		for(i=1;i<=l;i++)
		{
			dp[a][i]=inf;
			id[a][i]=inf;
		}
	
	for(a=0;a<n;a++)
	{
		dp[a][1<<a]=0;
		id[a][1<<a]=a;
		cm[a][a]=inf;
	}
	
	for(i=1;i<=l;i++)
		for(a=0;a<n;a++)
			if(i&(1<<a))
				for(j=0;j<n;j++)
					if(i&(1<<j) && cm[j][a]!=inf && dp[a][i^(1<<j)]!=inf)
					{
						k=dp[a][i^(1<<j)]+cm[j][a];
						if(k<dp[j][i])
						{
							dp[j][i]=k;
							id[j][i]=id[a][i^(1<<j)];
						}
					}
	rez=inf;
	for(a=0;a<n;a++)
		rez=min(rez, dp[a][l]+cm[id[a][l]][a]);
	
	fout<<rez<<"\n";
}