Submission #799925

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
799925	2023-08-01T08:26:27 Z	Sohsoh84	Dancing Elephants (IOI11_elephants)	C++17	50 / 100	9000 ms	3576 KB

elephants

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")

#include "elephants.h"
#include <bits/stdc++.h>

#pragma GCC target("avx2")

using namespace std;

const int MAXN = 50000 + 10;

int X[MAXN], n, L;
vector<int> vec; // TODO: multiset

void init(int N, int L_, int X_[]) {
	L = L_;
	for (int i = 0; i < N; i++) {
		X[i] = X_[i];	
		vec.push_back(X[i]);
	}

	n = N;
}

int update(int i, int y) {
	vec.erase(lower_bound(vec.begin(), vec.end(), X[i]));
	X[i] = y;
	vec.insert(lower_bound(vec.begin(), vec.end(), X[i]), X[i]);

	int ans = 0;
	int v = -(L + 1);
	
	for (int i = 0; i < n; i++) {
		if (vec[i] > v + L) {
			v = vec[i];
			ans++;
		}	
	}
	
	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	0 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	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct

Subtask #3

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	448 ms	2024 KB	Output is correct
8	Correct	602 ms	2260 KB	Output is correct
9	Correct	1034 ms	2624 KB	Output is correct
10	Correct	1266 ms	2900 KB	Output is correct
11	Correct	1146 ms	2900 KB	Output is correct
12	Correct	4603 ms	3044 KB	Output is correct
13	Correct	1401 ms	2772 KB	Output is correct

Subtask #4

0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	448 ms	2024 KB	Output is correct
8	Correct	602 ms	2260 KB	Output is correct
9	Correct	1034 ms	2624 KB	Output is correct
10	Correct	1266 ms	2900 KB	Output is correct
11	Correct	1146 ms	2900 KB	Output is correct
12	Correct	4603 ms	3044 KB	Output is correct
13	Correct	1401 ms	2772 KB	Output is correct
14	Correct	810 ms	2932 KB	Output is correct
15	Correct	1202 ms	2904 KB	Output is correct
16	Execution timed out	9007 ms	3576 KB	Time limit exceeded
17	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	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	448 ms	2024 KB	Output is correct
8	Correct	602 ms	2260 KB	Output is correct
9	Correct	1034 ms	2624 KB	Output is correct
10	Correct	1266 ms	2900 KB	Output is correct
11	Correct	1146 ms	2900 KB	Output is correct
12	Correct	4603 ms	3044 KB	Output is correct
13	Correct	1401 ms	2772 KB	Output is correct
14	Correct	810 ms	2932 KB	Output is correct
15	Correct	1202 ms	2904 KB	Output is correct
16	Execution timed out	9007 ms	3576 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-