# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96742 | jangwonyoung | Dancing Elephants (IOI11_elephants) | C++14 | 3613 ms | 11140 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<iostream>
#include<queue>
using namespace std;
const int bs=400;
int bc;
int x[150000];
int n,l;
vector<int>bl[400];
vector<int>dp[400];
vector<int>en[400];
int z[150000];
int rnd=0;
void yena(int pos){
dp[pos].resize(bl[pos].size()); dp[pos].shrink_to_fit();
en[pos].resize(bl[pos].size()); en[pos].shrink_to_fit();
if(bl[pos].empty()) return;
int ptr=bl[pos].size();
for(int i=(int)bl[pos].size()-1; i>=0 ;i--){
while(ptr!=0 && bl[pos][ptr-1]>l+bl[pos][i]) --ptr;
if(ptr==bl[pos].size()) dp[pos][i]=1,en[pos][i]=bl[pos][i]+l+1;
else dp[pos][i]=1+dp[pos][ptr],en[pos][i]=en[pos][ptr];
}
}
int sakura(){
int ans=0,cur=0;
for(int i=0; i<bc ;i++){
if(bl[i].empty() || bl[i].back()<cur) continue;
int pos=lower_bound(bl[i].begin(),bl[i].end(),cur)-bl[i].begin();
ans+=dp[i][pos],cur=en[i][pos];
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... |