/*
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|.\/\/.|
|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|
|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|/./\.\|
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|\.\/./|
|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|
|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|./\/\.|
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (signed i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (signed i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (signed i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define getbit(x, i) ((x) & (1 << (i)))
using namespace std;
using ll = long long;
using ld = long double;
template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
int countBits(int x) {
int res = 0;
for (; x; x -= x & -x)
++res;
return res;
}
const int maxN = 20, inf = 0x3f3f3f3f;
int n, k, c[maxN][maxN];
int DP(int mask) {
static int dp[1 << maxN];
static bool seen[1 << maxN];
if (!seen[mask]) {
seen[mask] = true;
if (countBits(mask) <= k)
return 0;
dp[mask] = inf;
fore(x, 0, n)
if (getbit(mask, x)) {
fore(y, 0, n) {
if (x == y || !getbit(mask, y))
continue;
mini(dp[mask], c[x][y] + DP(mask ^ (1 << x)));
}
}
}
return dp[mask];
}
int main() {
#ifdef LOCAL
freopen("input.INP", "r", stdin);
#endif // LOCAL
cin.tie(0) -> sync_with_stdio(0);
cout.tie(0);
cin >> n >> k;
fore(x, 0, n)
fore(y, 0, n)
cin >> c[x][y];
cout << DP((1 << n) - 1) << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
8 ms |
340 KB |
Output is correct |
| 6 |
Correct |
20 ms |
500 KB |
Output is correct |
| 7 |
Correct |
37 ms |
636 KB |
Output is correct |
| 8 |
Correct |
84 ms |
852 KB |
Output is correct |
| 9 |
Correct |
955 ms |
5436 KB |
Output is correct |
| 10 |
Correct |
92 ms |
4624 KB |
Output is correct |
