oj.uz

Submission #380269

# Submission time Handle Problem Language Result Execution time Memory
380269 2021-03-20T18:51:18 Z saarang123 Kronican (COCI16_kronican) C++17
100 / 100
 726 ms 4520 KB 
#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++) {
    	if(__builtin_popcount(mask) <= k) {
    		dp[mask] = 0;
    		continue;
    	}
    	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]);
    }
    cout << dp[(1 << n) - 1] << '\n';
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 7 ms 364 KB Output is correct
6 Correct 15 ms 492 KB Output is correct
7 Correct 28 ms 620 KB Output is correct
8 Correct 64 ms 876 KB Output is correct
9 Correct 726 ms 4520 KB Output is correct
10 Correct 62 ms 4460 KB Output is correct