# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8036 | baneling100 | Dancing Elephants (IOI11_elephants) | C++98 | 6292 ms | 24068 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>
#include <algorithm>
using namespace std;
int N, L, BucketNum, BucketLimit, Bucket[2][400][800], Size[400], Loc[150000][2];
int Next[400][800], Cnt[400][800], Temp[150000][2], Num;
void GiveInfo(int X) {
int BucketNow=Size[X];
if(!Size[X])
return;
Next[X][Size[X]-1]=Bucket[0][X][Size[X]-1]+L;
Cnt[X][Size[X]-1]=1;
for(int i=Size[X]-2 ; i>=0 ; i--) {
while(Bucket[0][X][i]+L<Bucket[0][X][BucketNow-1]) BucketNow--;
if(BucketNow==Size[X]) {
Next[X][i]=Bucket[0][X][i]+L;
Cnt[X][i]=1;
}
else {
Next[X][i]=Next[X][BucketNow];
Cnt[X][i]=Cnt[X][BucketNow]+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... |