Submission #261534

#	Time	Username	Problem	Language	Result	Execution time	Memory
261534		test2	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9053 ms	4048 KiB

elephants

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

#define I inline void 

using namespace std ; 

using ld = long double ; 
using ll = long long ; 

const int N = 1e6  + 7 , mod = 1e9 + 7 ; 

int n;
int c ; 

map<int , int > ele ; 
int pos[N]; 

void init(int N, int L, int X[])
{
	n = N;
	c = L ;
	for(int i = 0 ;i < N ;i++)
		ele[ X[i] ] ++  , pos[i] = X[i]  ;
}

int answer(){
	int ret = 0 ; 
	int l = -1e9 ; 
	for(auto u : ele){
		if(u.second){
			if(u.first > l + c){
				ret++ ; 
				l = u.first ; 
			}
		}
	}
	return ret ; 
}

int update(int i, int y)
{
	ele[pos[i]]--;
	pos[i]=y;
	ele[pos[i]]++;
	return answer() ;
}

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