제출 #98445

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98445		luciocf	Kronican (COCI16_kronican)	C++14	100 / 100	1942 ms	16900 KiB

kronican

#include <bits/stdc++.h>

using namespace std;

const int maxn = 21;
const long long inf = 2e18+10;

typedef long long ll;

ll dp[1<<maxn];

int n, k;

int num[maxn][maxn];

ll solve(int mask)
{
	if (__builtin_popcount(mask) == k) return 0LL;
	if (dp[mask] != -1) return dp[mask];

	ll ans = inf;
	for (int i = 0; i < n; i++)
	{
		if (!(mask&(1<<i))) continue;

		for (int j = 0; j < n; j++)
		{
			if (j == i || !(mask&(1<<j))) continue;

			int mask2 = mask^(1<<i);

			ans = min(ans, (ll)num[i][j]+solve(mask2));
		}
	}

	return dp[mask] = ans;
}

int main(void)
{
	cin >> n >> k;

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			cin >> num[i][j];

	memset(dp, -1LL, sizeof dp);

	cout << solve((1<<n)-1) << "\n";
}

• Subtask 1: 100 / 100