# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
380268 | saarang123 | Kronican (COCI16_kronican) | C++17 | 717 ms | 4716 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int mxn = 21;
int dp[1 << mxn], a[mxn][mxn];
signed main() {
std::ios::sync_with_stdio(0);
std::cout.tie(0);
std::cin.tie(0);
#ifdef saarang
freopen("/home/saarang/Documents/cp/input.txt", "r", stdin);
freopen("/home/saarang/Documents/cp/output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
cin >> a[i][j];
dp[0] = 0;
for(int mask = 1; mask < (1 << n); mask++) {
dp[mask] = 1e9;
for(int i = 0; i < n; i++) if(mask >> i & 1)
for(int j = 0; j < n; j++) if(mask >> j & 1) if(i != j)
dp[mask] = min(dp[mask], dp[mask ^ (1 << i)] + a[i][j]);
if(__builtin_popcount(mask) <= k)
dp[mask] = 0;
}
cout << dp[(1 << n) - 1] << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |