# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
669836 | Cyanmond | Cigle (COI21_cigle) | C++17 | 1089 ms | 98464 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>
int main() {
int N;
std::cin >> N;
std::vector<int> D(N);
for (auto &e : D) {
std::cin >> e;
}
std::vector<std::vector<int>> dp(N, std::vector<int>(N));
for (int s = 1; s < N; ++s) {
std::vector<int> a, b;
for (int i = s; i < N; ++i) {
a.push_back(D[i]);
if (i != s) {
a[i - s] += a[i - s - 1];
}
}
for (int i = 0; i < s; ++i) {
b.push_back(D[s - i - 1]);
if (i != 0) {
b[i] += b[i - 1];
}
}
const int t = (int)a.size();
std::vector<int> points;
std::vector<bool> is_p_a(t), is_p_b(s);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |