Submission #946610

#	Time	Username	Problem	Language	Result	Execution time	Memory
946610		StefanSebez	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9084 ms	9624 KiB

elephants

#include "elephants.h"
#include<bits/stdc++.h>
using namespace std;
const int N=150050;
int n,a[N],L;

void init(int N1, int L1, int X[])
{
	n = N1;
	for(int i=1;i<=n;i++){
		a[i]=X[i-1];
	}
	L=L1;
}

int update(int qind, int y)
{
	qind++;a[qind]=y;
	int b[n+10];
	for(int i=1;i<=n;i++) b[i]=a[i];
	sort(b+1,b+n+1);
	int res=0;
	for(int i=1;i<=n;){
		int j=i;
		res++;
		while(j<=n && b[j]-b[i]<=L) j++;
		i=j;
	}
	return res;
}

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