Submission #348634

#	Time	Username	Problem	Language	Result	Execution time	Memory
348634		tengiz05	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9083 ms	1900 KiB

elephants

#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();
	int tmp=*s.begin();
	s.erase(tmp);
	for(const int &x : s){
		if(x-lst > len){
			ans++;
			lst=x;
		}
	}s.insert(tmp);
	return ans;
}

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