Submission #799929

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
799929	2023-08-01T08:31:00 Z	Sohsoh84	Dancing Elephants (IOI11_elephants)	C++17	50 / 100	9000 ms	2088 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 = 70000;

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]);
	}

	while (vec.size() < MAXN) 
		vec.push_back(-1);
	
	n = N;
}

int update(int i, int y) {
	vec.erase(lower_bound(vec.begin(), vec.begin() + n, X[i]));
	X[i] = y;
	vec.insert(lower_bound(vec.begin(), vec.begin() + n - 1, X[i]), X[i]);

	int ans = 0;
	int v = -(L + 1);
	
	for (int i = 0; i < MAXN; 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	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	3 ms	976 KB	Output is correct

Subtask #2

16.0 / 16.0

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

Subtask #3

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	3 ms	976 KB	Output is correct
4	Correct	5 ms	976 KB	Output is correct
5	Correct	6 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	3397 ms	1616 KB	Output is correct
8	Correct	2845 ms	1616 KB	Output is correct
9	Correct	1751 ms	1872 KB	Output is correct
10	Correct	1839 ms	1960 KB	Output is correct
11	Correct	1738 ms	1872 KB	Output is correct
12	Correct	6012 ms	1872 KB	Output is correct
13	Correct	2039 ms	1872 KB	Output is correct

Subtask #4

0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	3 ms	976 KB	Output is correct
4	Correct	5 ms	976 KB	Output is correct
5	Correct	6 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	3397 ms	1616 KB	Output is correct
8	Correct	2845 ms	1616 KB	Output is correct
9	Correct	1751 ms	1872 KB	Output is correct
10	Correct	1839 ms	1960 KB	Output is correct
11	Correct	1738 ms	1872 KB	Output is correct
12	Correct	6012 ms	1872 KB	Output is correct
13	Correct	2039 ms	1872 KB	Output is correct
14	Correct	3226 ms	1872 KB	Output is correct
15	Correct	5295 ms	2000 KB	Output is correct
16	Execution timed out	9049 ms	2088 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	3 ms	976 KB	Output is correct
4	Correct	5 ms	976 KB	Output is correct
5	Correct	6 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	3397 ms	1616 KB	Output is correct
8	Correct	2845 ms	1616 KB	Output is correct
9	Correct	1751 ms	1872 KB	Output is correct
10	Correct	1839 ms	1960 KB	Output is correct
11	Correct	1738 ms	1872 KB	Output is correct
12	Correct	6012 ms	1872 KB	Output is correct
13	Correct	2039 ms	1872 KB	Output is correct
14	Correct	3226 ms	1872 KB	Output is correct
15	Correct	5295 ms	2000 KB	Output is correct
16	Execution timed out	9049 ms	2088 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-