| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 93187 | lalakep | Kronican (COCI16_kronican) | C++14 | 1022 ms | 4496 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 Nmax=22;
const int oo=1e9+7;
int n,k;
int f[Nmax][Nmax];
int dp[(1<<20)+7];
int best[Nmax][(1<<20)+2];
int slv(int bitmask)
{
int res=__builtin_popcount(bitmask);
if (res==k)
return 0;
if (dp[bitmask]!=-1)
return dp[bitmask];
int cur=1e9;
for (int i=0; i<=n-1; i++)
{
if ((bitmask&(1<<i))!=0)
{
int csmin=0;
for (int j=0;j<=n-1;j++)
{
if ((bitmask&(1<<j))!=0&&j!=i)
if (f[i+1][j+1]<f[i+1][csmin]) csmin=j+1;
}
cur=min(cur,slv(bitmask^(1<<i))+f[i+1][csmin]);
}
}
return dp[bitmask]=cur;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||