Submission #392935

#	Time	Username	Problem	Language	Result	Execution time	Memory
392935		Hazem	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9027 ms	3300 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

const int N1 = 2e5+10;

int n,l;
set<int>st;
int val[N1];

void init(int N, int L, int X[])
{	
	n = N,l = L;
	for(int i=0;i<n;i++)
		st.insert(X[i]),val[i] = X[i];
}

int update(int i, int y)
{
	st.erase(st.find(val[i]));
	st.insert(y);
	val[i] = y;
	
	vector<int>vec;
	for(auto x:st)
		vec.push_back(x);
	
	int ret = 0,cur = -1;
	for(auto x:vec)
		if(x>cur)ret++,cur = x+l;
		
	return ret;
}

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