# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13809 | gs14004 | Dancing Elephants (IOI11_elephants) | C++14 | 5286 ms | 21116 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 <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int U = 400;
const int B = 500;
struct elem{
int val;
int next;
int cnt;
};
bool operator<(elem a, elem b){ return a.val < b.val; }
elem bucket[305][905];
int size[305];
int sentinel;
int b[150005];
int a[150005], n, l;
int q_cnt;
void bucket_label(int bnum){
int pt = size[bnum];
for (int i=size[bnum]-1; i>=0; i--) {
while (pt && bucket[bnum][pt-1].val > bucket[bnum][i].val + l) {
pt--;
# | 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... |