# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054189 | sofijavelkovska | Boarding Passes (BOI22_passes) | C++17 | 170 ms | 141148 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=1e5, MAXK=15;
const long long INF=1e18;
string s;
int n, k;
vector<vector<int> > groups;
double geninv[MAXN+1], inv[MAXK][MAXK][MAXN+1];
double memo[(1<<MAXK)];
double dp(int mask)
{
if (memo[mask]!=-1)
return memo[mask];
if (mask==(1<<k)-1)
return memo[mask]=0;
double mintotal=INF;
for (int i=0; i<k; i++)
{
if (mask&(1<<i))
continue;
int l=0;
int r=groups[i].size();
int g=groups[i].size();
double minsum=INF;
while ((r-l)/3>0)
{
int t1=l+(r-l)/3;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |