Submission #348482

#	Time	Username	Problem	Language	Result	Execution time	Memory
348482		tengiz05	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9016 ms	2028 KiB

elephants

#include "elephants.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
int n, len;
int a[150005], b[150005];
int dp[150005];
void init(int N, int L, int X[]){
	n=N;
	len = L;
	for(int i=0;i<n;i++)b[i] = X[i];
}

int update(int i, int y){
	dp[0] = 1;
	b[i] = y;
	for(int i=0;i<n;i++)a[i] = b[i];
	sort(a,a+n);
	//~ for(int i=0;i<n;i++)cout << a[i] << ' ';
	//~ cout << '\n';
	for(int i=1;i<n;i++){
		dp[i] = dp[i-1]+1;
		for(int j=i-1;j>=0;j--){
			if(a[i] - a[j] <= len)dp[i] = min(dp[i], (j==0)?dp[j]:(dp[j-1]+1));
			else break;
		}
	}
	//~ for(int i=0;i<n;i++)cout << dp[i] << ' ';
	//~ cout << '\n';
	return dp[n-1];
}

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