제출 #1108104

#제출 시각아이디문제언어결과실행 시간메모리
1108104overwatch9Kronican (COCI16_kronican)C++17
30 / 100
322 ms4432 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++) { if (__builtin_popcount(i) <= 1) { dp[i] = 0; if (__builtin_popcount(i) == n-k+1) ans = 0; continue; } vector <int> ls; for (int j = 0; j < n; j++) { if (i & (1 << j)) ls.push_back(j); } for (auto j : ls) { for (auto k : ls) { if (j == k) continue; dp[i] = min(dp[i], dp[i ^ (1 << j)] + adj[j][k]); } } if (__builtin_popcount(i) == n-k+1) ans = min(ans, dp[i]); } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...