Submission #133857

#	Time	Username	Problem	Language	Result	Execution time	Memory
133857		Boxworld	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	20 ms	1988 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
struct O{int p,id;}a[110];
int n,l;
bool cmp(O x,O y){
	return x.p<y.p;
}
void init(int N, int L, int X[]){
	n=N;l=L;
	for (int i=0;i<N;i++)a[i].p=X[i],a[i].id=i;
}
int update(int id, int y){
	for (int i=0;i<n;i++)
	if (a[i].id==id)a[i].p=y;
	sort(a,a+n,cmp);
	int ans=1,last=a[0].p;
	for (int i=1;i<n;i++)
	if (a[i].p-last>l){
		last=a[i].p;
		ans++;
	}
	return ans;
}

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