oj.uz

Submission #98493

# Submission time Handle Problem Language Result Execution time Memory
98493 2019-02-23T19:05:06 Z pamaj Kronican (COCI16_kronican) C++14
100 / 100
 1358 ms 4600 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];

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.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 23 ms 504 KB Output is correct
7 Correct 45 ms 632 KB Output is correct
8 Correct 110 ms 856 KB Output is correct
9 Correct 1358 ms 4600 KB Output is correct
10 Correct 95 ms 4472 KB Output is correct