Submission #347359

#	Time	Username	Problem	Language	Result	Execution time	Memory
347359		Mefarnis	Dancing Elephants (IOI11_elephants)	C++14	0 / 100	1 ms	364 KiB

elephants

#include <bits/stdc++.h>
#include "elephants.h"
#define maxn 100
using namespace std;

int n,k;
int ar[maxn];

void init(int N, int K, int x[]) {
	n = N;
	k = K;
	for( int i = 0 ; i < n ; i++ )
		ar[i] = x[i];
}

int update(int i, int y) {
	ar[i] = y;
	sort(ar,ar+n);
	int ans = 0;
	int last = INT_MIN;
	for( int i = 0 ; i < n ; i++ )
		if(ar[i] > last+k)
			ans++ , last = ar[i];
	return ans;
}

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