# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167146 | sans | Kronican (COCI16_kronican) | C++11 | 1756 ms | 8572 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 <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 21;
int N, K, dp[1 << MAXN], a[MAXN][MAXN];
int solve(int mask){
if(__builtin_popcount(mask) == K) return 0;
int &ret = dp[mask];
if(ret != -1) return ret;
ret = 1 << 30;
for(int i = 0; i < N; ++i){
if(!(mask & (1 << i))) continue;
for(int j = 0; j < N; ++j){
if(i == j) continue;
if(!(mask & 1 << j)) continue;
ret = min(ret, solve(mask ^ (1 << i)) + a[i][j]);
}
}
return ret;
}
int main(int argc, char **argv){
scanf("%d %d", &N, &K);
memset(dp, -1, sizeof dp);
for(int i = 0; i < N; ++i)
for(int j = 0; j < N; ++j)
scanf("%d", &a[i][j]);
printf("%d\n", solve((1 << N)-1));
return 0;
}
//cikisir
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |