# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627503 | MilosMilutinovic | Kronican (COCI16_kronican) | C++14 | 648 ms | 4392 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>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 1e9;
int n, k, c[20][20], dp[1 << 20];
int main()
{
scanf("%d%d", &n, &k);
rep(i, n) rep(j, n) scanf("%d", &c[i][j]);
rep(i, 1 << n) dp[i] = INF;
dp[(1 << n) - 1] = 0;
for(int mask = (1 << n) - 1; mask >= 0; mask --) {
rep(i, n) if(mask >> i & 1) {
int mn = INF;
rep(j, n) if(i != j && (mask >> j & 1)) mn = min(mn, c[i][j]);
dp[mask ^ (1 << i)] = min(dp[mask ^ (1 << i)], dp[mask] + mn);
}
}
int ans = INF;
rep(i, (1 << n)) if(__builtin_popcount(i) == k) ans = min(ans, dp[i]);
printf("%d", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |