Submission #900265

#TimeUsernameProblemLanguageResultExecution timeMemory
900265Muhammad_AneeqDancing Elephants (IOI11_elephants)C++17
26 / 100
9056 ms8284 KiB
#include <set>
#include "elephants.h"
using namespace std;
int const MAXN=2e5+10;
int pos[MAXN]={};
multiset<int>s;
int l;
void init(int N, int L, int X[])
{
	l=L;
	for (int i=0;i<N;i++)
	{
		pos[i]=X[i];
		s.insert(X[i]);
	}
}
int update(int i, int y)
{
	s.erase(s.find(pos[i]));
	pos[i]=y;
	s.insert(y);
	int z=0;
	auto f=begin(s);
	while (f!=s.end())
	{
		f=s.upper_bound(*f+l);
		z++;
	}
	return z;
}
#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...