# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
726082 | Alex_tz307 | Dancing Elephants (IOI11_elephants) | C++17 | 375 ms | 2004 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>
#include "elephants.h"
using namespace std;
const int kN = 1e5 + 5e4;
const int bucketSize = 150;
const int kBuckets = 100;
int n, len, a[kN], bucket[kN], indexInBucket[kN];
int updates, auxSize, auxIndices[kN];
class bucket_t {
private:
int N, indices[2 * bucketSize];
int req[2 * bucketSize], maxReach[2 * bucketSize];
public:
void reset() {
N = 0;
}
bool isEmpty() {
return N == 0;
}
int getSize() {
return N;
}
int last() {
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... |