# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98743 | pamaj | Kronican (COCI16_kronican) | C++14 | 806 ms | 8704 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 maxn = 20;
#define int uint_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++)
{
if(!(mask & (1 << i))) continue;
for(int j = 0; j < n; j++)
{
if(i == j or !(mask & (1 << j))) continue;
ans = min(ans, dp[mask ^ (1 << i)] + c[i][j]);
}
}
dp[mask] = ans;
}
cout << dp[(1 << n) - 1] << "\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |