Submission #348639

#TimeUsernameProblemLanguageResultExecution timeMemory
348639tengiz05Dancing Elephants (IOI11_elephants)C++17
26 / 100
9024 ms1900 KiB
#include "elephants.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
int len, a[50000];
set<int> s;
void init(int N, int L, int X[]){
	len = L;
	for(int i=0;i<N;i++)a[i] = X[i];
	for(int i=0;i<N;i++)s.insert(a[i]);
}
 
int update(int i, int y){
	int ans = 1;
	s.erase(a[i]);
	a[i] = y;
	s.insert(a[i]);
	int lst=*s.begin();
	int tmp=lst;
	s.erase(tmp);
	for(const int &x : s)
		if(x-lst > len)
			ans++,lst=x;
	s.insert(tmp);
	return ans;
}
#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...