Submission #98740

#	Time	Username	Problem	Language	Result	Execution time	Memory
98740		pamaj	Kronican (COCI16_kronican)	C++17	100 / 100	869 ms	8604 KiB

kronican

#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
#define int int_fast32_t
 
#pragma GCC optimize ("Ofast")
 
int n, k;
int c[maxn][maxn];
int dp[1 << 20];
 
int32_t main()
{	
	ios::sync_with_stdio(false), cin.tie(nullptr);
	cin >> n >> k;
 
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
			cin >> c[i][j];
	}
 
 
	for(int mask = 0; mask < (1 << n); mask++)
	{
		if(__builtin_popcount(mask) <= k) {dp[mask] = 0; continue;}
 
		int ans = 1e7;
 
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				if(i == j or !(mask & (1 << i)) or !(mask & (1 << j))) continue;
 
				ans = min(ans, dp[mask ^ (1 << i)] + c[i][j]);
			}
		}
 
		dp[mask] = ans;
	}
 
	cout << dp[(1 << n) - 1] << "\n";
}

• Subtask 1: 100 / 100