# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123482 | nxteru | Dancing Elephants (IOI11_elephants) | C++14 | 3149 ms | 9180 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 <bits/stdc++.h>
using namespace std;
#define MAX_N 150005
#define B 350
int n,k,bs[MAX_N/B+1],p[MAX_N],pl[MAX_N],l,cnt,ds[MAX_N/B+1][B*3],sz[MAX_N/B+1][B*3],el[MAX_N/B+1][B*3];
void Bini(int x,int *xel,int xbs,int *xds,int *xsz){
sort(xel,xel+xbs);
int r=xbs;
for(int i=xbs-1;i>=0;i--){
while(r-1>=0&&xel[i]+l<xel[r-1])r--;
if(r==xbs){
xds[i]=xel[i]+l;
xsz[i]=1;
}else{
xds[i]=xds[r];
xsz[i]=xsz[r]+1;
}
}
}
void ALLini(void){
for(int i=0;i<n;i++)pl[i]=p[i];
sort(pl,pl+n);
bs[0]=0;
k=0;
for(int i=0;i<n;i++){
if(bs[k]>=B){
k++;
bs[k]=0;
}
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... |