Submission #348553

#	Time	Username	Problem	Language	Result	Execution time	Memory
348553		Kerim	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9092 ms	1772 KiB

elephants

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

int update(int pos, int val){
	org[pos]=val;
	for(int i=0;i<n;i++)
		arr[i]=org[i];
	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: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3