Submission #72865

#TimeUsernameProblemLanguageResultExecution timeMemory
72865KLPPDancing Elephants (IOI11_elephants)C++14
26 / 100
9024 ms2780 KiB
#include "elephants.h"
#include<set>
#include<iostream>
using namespace std;
typedef std::multiset<int>::iterator mit;
int n;
multiset<int> s;
int l;
int positions[1000000];
void init(int N, int L, int X[])
{
	l=L;
	n=N;
	for(int i=0;i<n;i++){
		positions[i]=X[i];
		s.insert(X[i]);
	}
}

int update(int i, int y)
{
	mit it=s.find(positions[i]);
	s.erase(it);
	s.insert(y);
	it=s.begin();
	int cnt=0;
	while(it!=s.end()){
		int next=*it+l;
		it=s.upper_bound(next);
		cnt++;
	}positions[i]=y;
	return cnt;
}
#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...