# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657444 | bicsi | Olympiads (BOI19_olympiads) | C++14 | 455 ms | 112936 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];
vector<int> acc(1 << k), tr(1 << k);
auto push = [&](vector<int>& dp, vector<int>& v, vector<int>& ret, vector<int>& trace) {
acc = dp; fill(tr.begin(), tr.end(), 0);
for (int i = 0; i < k; ++i) {
for (int msk = 0; msk < (1 << k); ++msk) {
if (msk & (1 << i)) continue;
if (acc[msk] < 0) continue;
if (acc[msk | (1 << i)] < acc[msk] + v[i]) {
acc[msk | (1 << i)] = acc[msk] + v[i];
tr[msk | (1 << i)] = (tr[msk] | (1 << i));
}
}
}
for (int i = 0; i < (1 << k); ++i)
if (ret[i] < acc[i])
ret[i] = acc[i], trace[i] = tr[i];
};
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... |