# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696986 | allllekssssa | Bootfall (IZhO17_bootfall) | C++14 | 1098 ms | 16852 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 = 510;
const int bsSize = 250010;
int n;
int a[maxN];
bitset<bsSize> dp[2][maxN];
int main() {
cin >> n;
int sum = 0;
for (int i = 1; i<=n; i++) {
cin >> a[i];
sum+=a[i];
}
for (int i = 1; i <= n + 1; i++) {
dp[0][i].set(0);
}
for (int i = 1; i<=n; i++) {
for (int j = 1; j <= n + 1; j++) {
if (i == j) {
dp[i&1][j] = dp[(i&1) ^ 1][j];
} else {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |