| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 98445 | luciocf | Kronican (COCI16_kronican) | C++14 | 1942 ms | 16900 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;
const int maxn = 21;
const long long inf = 2e18+10;
typedef long long ll;
ll dp[1<<maxn];
int n, k;
int num[maxn][maxn];
ll solve(int mask)
{
if (__builtin_popcount(mask) == k) return 0LL;
if (dp[mask] != -1) return dp[mask];
ll ans = inf;
for (int i = 0; i < n; i++)
{
if (!(mask&(1<<i))) continue;
for (int j = 0; j < n; j++)
{
if (j == i || !(mask&(1<<j))) continue;
int mask2 = mask^(1<<i);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||