Submission #348884

#	Time	Username	Problem	Language	Result	Execution time	Memory
348884		juggernaut	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9037 ms	2924 KiB

elephants

#include"elephants.h"
#include<bits/stdc++.h>
using namespace std;
int n,pos[150001],l;
multiset<int>myset;
void init(int N,int L,int X[]){
	n=N,l=L;
	for (int i=0;i<n;i++){
		pos[i]=X[i];
		myset.insert(X[i]);
	}
}
int update(int i,int y){
	myset.erase(myset.find(pos[i]));
	myset.insert(y);
	int b=-1,ans=0;
	for(auto it:myset){
		if(it<=b)continue;
		b=it+l,ans++;
	}
	pos[i]=y;
	return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3