Submission #583564

#	Time	Username	Problem	Language	Result	Execution time	Memory
583564		benson1029	Dancing Elephants (IOI11_elephants)	C++14	0 / 100	1 ms	340 KiB

elephants

#include "elephants.h"
#include<bits/stdc++.h>
using namespace std;

int n;
int l;
pair<int,int> tmp[150005];
int x[150005];
int pos[150005];

void init(int N, int L, int X[])
{
	n = N;
	l = L;
	for(int i=0; i<n; i++) {
		tmp[i] = make_pair(X[i], i);
	}
	sort(tmp, tmp+n);
	for(int i=0; i<n; i++) {
		x[i] = tmp[i].first;
		pos[tmp[i].second] = i;
	}
}

int update(int i, int y)
{
	int ptr = pos[i];
	x[ptr] = y;
	while(ptr > 0 && x[ptr] < x[ptr-1]) {
		swap(pos[x[ptr]], pos[x[ptr-1]]);
		swap(x[ptr], x[ptr-1]);
		--ptr;
	}
	while(ptr < n-1 && x[ptr] > x[ptr+1]) {
		swap(pos[x[ptr]], pos[x[ptr+1]]);
		swap(x[ptr], x[ptr+1]);
		++ptr;
	}
	int past = -1e9;
	int ans = 0;
	for(int i=0; i<n; i++) {
		if(i==0 || past+l < x[i]) {
			ans++;
			past = x[i];
		}
	}
	return ans;
}

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