Submission #98462

#	Time	Username	Problem	Language	Result	Execution time	Memory
98462		thiago4532	Kronican (COCI16_kronican)	C++17	100 / 100	1707 ms	8676 KiB

kronican

#include <bits/stdc++.h>
// #define int int64_t
 
using namespace std;
const int maxn = 30;
int c[maxn][maxn];
int dp[1<<(maxn-9)];
int n, k;
 
int solve(int mask){
	if(__builtin_popcount(mask) == k) return 0;
	if(dp[mask] != -1) return dp[mask];

	//cout << bitset<10>(mask) << "\n";
	int ans=0x3f3f3f3f;
	for(int i=1;i<=n;i++){
		if(!(mask&(1<<(i-1)))) continue;
 
		for(int j=1;j<=n;j++){
			if(i==j || !(mask&(1<<(j-1)))) continue;
			int mask2 = mask & ~(1<<(i-1));
			ans = min(ans, c[i][j] + solve(mask2));
		}
	}
	return dp[mask] = ans;
}
 
int32_t main(){
	//memset(c, 0x3f3f3f3f, sizeof c);
	memset(dp, -1, sizeof dp);
	cin >> n >> k;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin >> c[i][j];
		}
	}
	cout << solve((1<<n)-1) << "\n";
	return 0;
}

• Subtask 1: 100 / 100