# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447303 | XBoRickie | Kronican (COCI16_kronican) | C++11 | 1407 ms | 8572 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
// Typedef
typedef long double ld;
typedef long long int int64;
typedef unsigned long long int uint64;
typedef std::pair<int, int> PII;
typedef std::pair<int64, int64> PLL;
typedef std::vector<int> VI;
typedef std::vector<long long> VLL;
// Define For-loop
#define FOR(i, j, k, in) for (int i = (j); i < (k) ; i += (in))
#define FORW(i, j, k, in) for (int i = (j); i <= (k); i += (in))
#define RFOR(i, j, k, in) for (int i = (j); i >= (k); i -= (in))
// Define Data structure func
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define sz(cont) int((cont).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
// Define number
#define IINF 0x3f3f3f3f
#define LLINF 1000111000111000111LL
#define PI 3.1415926535897932384626433832795
// Other
#define lend '\n'
#define hardio(name) freopen(name".inp","r",stdin), freopen(name".out","w",stdout);
void FastIO() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); cin.exceptions(cin.failbit); srand(time(NULL)); }
const int MOD = 1e9 + 7, MOD2 = 1e9 + 9;
// ======================================================================
int n, k;
int a[30][30] = {};
int dp[1 << 21] = {};
int recur(int mask = 0) {
if (__builtin_popcount(mask) == k) return 0;
int &ans = dp[mask];
if (ans != -1) return ans;
ans = IINF;
FOR(i, 0, n, 1) {
if (!(mask & (1 << i))) continue;
FOR(j, 0, n, 1) {
if (i == j) continue;
if (!(mask & (1 << j))) continue;
ans = min(ans, recur(mask ^ (1 << i)) + a[i][j]);
}
}
return ans;
}
int main(int argc, char* argv[]) {
FastIO();
memset(dp, -1, sizeof dp);
cin >> n >> k;
FOR(i, 0, n, 1) FOR(j, 0, n, 1) cin >> a[i][j];
cout << recur((1 << n) - 1) << endl;
return 0; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |