Submission #348551

#	Time	Username	Problem	Language	Result	Execution time	Memory
348551		Kerim	Dancing Elephants (IOI11_elephants)	C++17	0 / 100	1 ms	364 KiB

elephants

#include "elephants.h"
#include "bits/stdc++.h"
using namespace std;
#define MAXN 100004
int n,l,arr[MAXN];
void init(int N, int L, int X[]){
  	n = N; l = L;
	for(int i=0;i<n;i++)
		arr[i]=X[i];
}

int update(int pos, int val){
	arr[pos]=val;sort(arr,arr+n);
	int ans=0,last=-1;
	for(int i=0;i<n;i++)
		if(last<arr[i]){
			ans++;
			last=arr[i]+l;	
		}
  	return ans;
}

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