Submission #916785

#	Time	Username	Problem	Language	Result	Execution time	Memory
916785		Wansur	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9047 ms	12636 KiB

elephants

#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n';

using namespace std;
typedef long long ll;
const int mx=2e5+12;

set<int> s;
int a[mx];
int n,k;

void init(int N, int L, int X[]){
	n=N,k=L;
	for(int i=0;i<n;i++){
		a[i]=X[i];
		s.insert(a[i]);
	}
	
}
int update(int i, int y){
	s.erase(a[i]);
	a[i]=y;
	s.insert(a[i]);
	int last=-1,ans=0;
	for(int x:s){
		if(x>last){
			last=x+k;
			ans++;
		}
	}
	return ans;
}

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