Submission #1108158

#TimeUsernameProblemLanguageResultExecution timeMemory
1108158overwatch9Kronican (COCI16_kronican)C++17
100 / 100
522 ms4540 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector <vector <int>> adj(n, vector <int> (n)); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cin >> adj[i][j]; } vector <int> dp((1 << n) + 1, 1e9); dp[0] = 0; int ans = 1e9; for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < n; j++) { if (i & (1 << j)) { for (int l = 0; l < n; l++) { if (i & (1 << l)) continue; dp[i] = min(dp[i], dp[i ^ (1 << j)] + adj[j][l]); } } } if (__builtin_popcount(i) == n-k) ans = min(ans, dp[i]); } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...