Submission #18016

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
180162016-01-18 08:18:46cometDancing Elephants (IOI11_elephants)C++98
100 / 100
8537 ms22608 KiB
#include <cstdio>
#include <algorithm>
using namespace std;
int N,M,L;
int B=500;
struct group{
int sz,p[1010],cnt[1010],nxt[1010];
void init(){
int id=sz-1;
for(int i=sz-1;i>=0;i--){
if(p[sz-1]-p[i]<=L)cnt[i]=1,nxt[i]=p[i]+L+1;
else{
while(p[id]-p[i]>L)id--;
cnt[i]=cnt[id+1]+1;
nxt[i]=nxt[id+1];
}
}
}
void push(int x){
int id=0;
while(id<sz&&p[id]<=x)id++;
sz++;
for(int i=sz-1;i>id;i--)p[i]=p[i-1];
p[id]=x;
init();
}
void pop(int x){
int id=0;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...