#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const int INF = 1e6;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT
freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else
/* online submission */
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/*************************COCI 16-17 R3 #3*************************/
//int __builtin_popcount(int s) {
// int cnt = 0;
// FORE(i, 0, 31) if (s&(1 << i)) cnt++;
// return cnt;
//}
int N, K;
int cost[20][20];
int dp[1 << 20];
int main() {
io();
cin >> N >> K;
FOR(i, 0, N) FOR(j, 0, N)
cin >> cost[i][j];
FOR(s, 0, 1 << N) {
dp[s] = INF;
if (__builtin_popcount(s) <= K) {
dp[s] = 0;
continue;
}
FOR(i, 0, N) FOR(j, 0, N) if (i!=j && (s&(1 << i)) > 0 && (s & (1 << j)) > 0) {
minn(dp[s], cost[i][j] + dp[s ^ (1 << i)]);
}
}
cout << dp[(1 << N) - 1] << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
512 KB |
Output is correct |
| 3 |
Correct |
2 ms |
512 KB |
Output is correct |
| 4 |
Correct |
2 ms |
512 KB |
Output is correct |
| 5 |
Correct |
12 ms |
528 KB |
Output is correct |
| 6 |
Correct |
28 ms |
660 KB |
Output is correct |
| 7 |
Correct |
51 ms |
932 KB |
Output is correct |
| 8 |
Correct |
119 ms |
1100 KB |
Output is correct |
| 9 |
Correct |
1425 ms |
4876 KB |
Output is correct |
| 10 |
Correct |
97 ms |
4876 KB |
Output is correct |
