/*
author: Haunted_Cpp
"Persistence guarantees that results are inevitable"
*/
#include <iostream>
#include <algorithm>
#include <vector>
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int N = 20 + 1;
int dp [1 << N], g [N][N], n, k;
int dfs (int mask) {
if (__builtin_popcount(mask) <= k) return 0;
int &res = dp[mask];
if (res) return res;
res = 1e9;
for (int i = 0; i < n; i++) {
if (((mask >> i) & 1) == 0) continue;
for (int j = i + 1; j < n; j++) {
if (((mask >> j) & 1) == 0) continue;
int A = mask ^ (1 << i);
int B = mask ^ (1 << j);
res = min (res, g[i][j] + dfs (A));
res = min (res, g[j][i] + dfs (B));
}
}
return res;
}
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> g[i][j];
}
}
cout << dfs ((1 << n) - 1) << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
12 ms |
384 KB |
Output is correct |
6 |
Correct |
24 ms |
512 KB |
Output is correct |
7 |
Correct |
40 ms |
640 KB |
Output is correct |
8 |
Correct |
88 ms |
896 KB |
Output is correct |
9 |
Correct |
1065 ms |
4496 KB |
Output is correct |
10 |
Correct |
904 ms |
3772 KB |
Output is correct |