# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1024015 | kustizus | Kronican (COCI16_kronican) | C++17 | 735 ms | 4700 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>
#define ll long long int
using namespace std;
const int N = 21;
int n, k, a[N][N], dp[1 << N];
int Solve(int mask)
{
if (__builtin_popcount(mask) == k)
return 0;
int &res = dp[mask];
if (res != -1)
return res;
res = 1e9;
vector<int> now;
for (int i = 0; i < n; i++)
if (mask & (1 << i))
now.push_back(i);
for (int i = 0; i < now.size(); i++)
for (int j = 0; j < now.size(); j++)
if (i != j)
res = min(res, Solve(mask ^ (1 << now[i])) + a[now[i]][now[j]]);
return res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen ("file.inp","r",stdin);
// freopen ("file.out","w",stdout);
cin >> n >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> a[i][j];
for (int i = 0; i < (1 << n); i++)
dp[i] = -1;
cout << Solve((1 << n) - 1);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |