# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98471 | wjoao | Kronican (COCI16_kronican) | C++11 | 2058 ms | 384 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 maxn 20
#define inf 0x3f3f3f3f
#define maxb (1<<maxn)
using namespace std;
int g[50][50], n, k, pd[maxb];
int solve(int bitmask){
if(__builtin_popcount(bitmask) == k) return 0;
int best = inf;
for(int i = 0; i < n; i++){
if(!((1<<i)&bitmask)){
int cost = inf;
for(int j = 0; j < n; j++){
if(i==j) continue;
if(!((1<<j)&bitmask)){
cost = min(cost, g[i][j]);
}
}
best = min(best, cost + solve(bitmask|(1<<i)));
}
}
return best;
}
int main(){
scanf(" %d %d", &n, &k);
k = n-k;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++ )
scanf(" %d", &g[i][j]);
printf("%d\n", solve(0));
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |