oj.uz

Submission #98480

# Submission time Handle Problem Language Result Execution time Memory
98480 2019-02-23T18:36:15 Z pamaj Kronican (COCI16_kronican) C++14
90 / 100
 2000 ms 4496 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;

#pragma GCC optimize("Ofast")

int n, k;
int c[maxn][maxn];
int dp[1 << 20];

int solve(int mask)
{
	if(__builtin_popcount(mask) >= n - k) return 0;

	if(dp[mask] != -1) return dp[mask];

	int ans = 1e9;
	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, solve(mask | (1 << i)) + c[i][j]);
		}
	}

	return dp[mask] = ans;
}


int32_t main()
{
	cin >> n >> k;

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

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

	cout << solve(0) << "\n";

}

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4480 KB Output is correct
2 Correct 6 ms 4480 KB Output is correct
3 Correct 5 ms 4480 KB Output is correct
4 Correct 6 ms 4480 KB Output is correct
5 Correct 19 ms 4352 KB Output is correct
6 Correct 41 ms 4496 KB Output is correct
7 Correct 76 ms 4352 KB Output is correct
8 Correct 152 ms 4460 KB Output is correct
9 Execution timed out 2019 ms 4480 KB Time limit exceeded
10 Correct 142 ms 4352 KB Output is correct