Submission #348205

#	Time	Username	Problem	Language	Result	Execution time	Memory
348205		soroush	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9005 ms	1132 KiB

elephants

#pragma GCC optimize("O2")
//#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 150010;

int n , l;
int x[maxn];
int a[maxn];

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

int update(int p , int v){
	x[p] = v;
	for(int i = 0 ; i < n ; i ++)a[i] = x[i];
	sort(a , a + n);
	int ans = 1;
	int L = a[0];
	for(int i = 1 ; i < n ; i ++)
		if(a[i] - L > l)
			L = a[i] , ans ++;
	return(ans);
}

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