Submission #348630

#TimeUsernameProblemLanguageResultExecution timeMemory
348630tengiz05Dancing Elephants (IOI11_elephants)C++17
26 / 100
9037 ms5228 KiB
#include "elephants.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
int n, len;
int a[50000];
set<int> s;
void init(int N, int L, int X[]){
	n=N;
	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();
	for(const int &x : s){
		if(x == lst)continue;
		if(x-lst > len){
			ans++;
			lst=x;
		}
	}
	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...