# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657434 | bicsi | Olympiads (BOI19_olympiads) | C++14 | 1105 ms | 112760 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;
int main() {
int n, k, c; cin >> n >> k >> c;
vector<vector<int>> M(n, vector<int>(k));
for (int i = 0; i < n; ++i)
for (int j = 0; j < k; ++j)
cin >> M[i][j];
auto push = [&](vector<int>& dp, vector<int>& v, vector<int>& ret, vector<int>& trace) {
fill(trace.begin(), trace.end(), -1);
for (int sub = 0; sub < (1 << k); ++sub) {
int extra = 0;
for (int i = 0; i < k; ++i)
if (sub & (1 << i))
extra += v[i];
for (int msk = sub; msk < (1 << k); msk = ((msk + 1) | sub)) {
if (dp[msk ^ sub] < 0) continue;
int now = dp[msk ^ sub] + extra;
if (ret[msk] < now) {
ret[msk] = now;
trace[msk] = sub;
}
}
}
};
vector<vector<vector<int>>> suff(n + 1,
Compilation message (stderr)
# | 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... |