# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133400 | Vlatko | Vještica (COCI16_vjestica) | C++14 | 311 ms | 1264 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 pii = pair<int, int>;
const int maxn = 16;
const int A = 26;
const int inf = 1e9;
int n;
int cnt[maxn][A];
int dp[1<<maxn];
int num_common(int mask) {
int mincnt[A];
for (int j = 0; j < A; ++j) {
mincnt[j] = inf;
}
for (int i = 0; i < n; ++i) {
if (mask & (1 << i)) {
for (int j = 0; j < A; ++j) {
mincnt[j] = min(mincnt[j], cnt[i][j]);
}
}
}
int res = 0;
for (int j = 0; j < A; ++j) {
res += mincnt[j];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |