# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5041 | cki86201 | Dancing Elephants (IOI11_elephants) | C++98 | 5844 ms | 21744 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 "elephants.h"
#include <math.h>
const int N_ = 150050;
const int SN = 400;
int bk_sz, counter, L, N;
int D[N_], tmp[N_];
struct Group{
Group(){
for(int i=0;i<SN*2;i++)w[i]=c[i]=en[i]=0;
sz=0;
}
int w[SN*2], en[SN*2], c[SN*2];
int sz;
void fix(){
int s;
for(s=sz-1;s!=-1 && w[sz-1] - w[s] <= L;s--)c[s] = 1, en[s] = w[s] + L;
for(int e = sz-1;s!=-1;s--){
while(w[e] - w[s] > L)e--;
c[s] = c[e+1] + 1;
en[s] = en[e+1];
}
}
void update(int v){
int i, ins;
for(ins=0;w[ins]<=v && ins!=sz;ins++);
sz++;
for(i=sz-1;i>ins;i--)w[i] = w[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... |