Submission #583567

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
583567	2022-06-25T15:35:56 Z	benson1029	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9000 ms	3256 KB

elephants

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

int n;
int l;
pair<int,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++) {
		x[i] = make_pair(X[i], i);
	}
	sort(x, x+n);
	for(int i=0; i<n; i++) {
		pos[x[i].second] = i;
	}
}

int update(int i, int y)
{
	int ptr = pos[i];
	x[ptr].first = y;
	while(ptr > 0 && x[ptr] < x[ptr-1]) {
		swap(pos[x[ptr].second], pos[x[ptr-1].second]);
		swap(x[ptr], x[ptr-1]);
		--ptr;
	}
	while(ptr < n-1 && x[ptr] > x[ptr+1]) {
		swap(pos[x[ptr].second], pos[x[ptr+1].second]);
		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].first) {
			ans++;
			past = x[i].first;
		}
	}
	return ans;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct

Subtask #2

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct

Subtask #3

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1728 ms	2012 KB	Output is correct
8	Correct	2556 ms	2200 KB	Output is correct
9	Correct	2139 ms	3256 KB	Output is correct
10	Execution timed out	9087 ms	3020 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #4

0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1728 ms	2012 KB	Output is correct
8	Correct	2556 ms	2200 KB	Output is correct
9	Correct	2139 ms	3256 KB	Output is correct
10	Execution timed out	9087 ms	3020 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #5

0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1728 ms	2012 KB	Output is correct
8	Correct	2556 ms	2200 KB	Output is correct
9	Correct	2139 ms	3256 KB	Output is correct
10	Execution timed out	9087 ms	3020 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-