# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947324 | MinaRagy06 | Dancing Elephants (IOI11_elephants) | C++17 | 2589 ms | 23136 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;
#define ll long long
#define SZ(x) (int) x.size()
int n, l;
const int N = 150'005, B = 400;
struct block {
int n;
vector<int> v;
vector<array<int, 2>> dp;
void build() {
n = v.size();
dp.resize(n);
int p = n;
for (int i = n - 1; i >= 0; i--) {
while (p - 1 >= 0 && v[p - 1] >= v[i] + l) {
p--;
}
if (v[i] + l <= v.back()) {
dp[i] = {dp[p][0] + 1, dp[p][1]};
} else {
dp[i] = {1, v[i] + l};
}
}
}
void insert(int x) {
v.push_back(x);
for (int i = v.size() - 1; i - 1 >= 0; i--) {
if (v[i] <= v[i - 1]) {
# | 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... |