# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227470 | spdskatr | Dancing Elephants (IOI11_elephants) | C++14 | 7245 ms | 14944 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.
// This problem is cooked
#include "elephants.h"
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <utility>
#include <cassert>
#define fi first
#define se second
#define K 404 // Not found
using namespace std;
typedef pair<int, int> pii;
int N, L, cnt, loc[150005], curblock[150005];
pair<int, int> el[150005];
struct block {
int val[K<<1], pos[K<<1], dp[K<<1], ext[K<<1], sz;
void reset() {
fill(val, val+K, 0);
fill(dp, dp+K, 0);
}
void recalc() {
int rp = sz;
for (int i = sz - 1; i >= 0; i--) {
while (pos[rp-1] > pos[i] + L) rp--;
if (rp == sz) {
dp[i] = 1;
ext[i] = pos[i] + L + 1;
} 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... |