# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241891 | NONAME | Vještica (COCI16_vjestica) | C++14 | 0 ms | 0 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;
using ll = long long;
using ld = long double;
const int oo = (1 << 30);
int n, dp[(1 << 16)], cnt[20][26];
int calc(int msk) {
int c[26];
fill(c, c + 26, inf);
for (int i = 0; i < n; ++i)
if ((1 << i) & msk) {
for (int j = 0; j < 26; ++j)
c[j] = min(c[j], cnt[i][j]);
}
int len = 0;
for (int i = 0; i < 26; ++i)
len += c[i];
return len;
}
int solve(int msk) {
int &res = dp[msk];