Submission #799956

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

elephants

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

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

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(numeric_limits<int>::max());
}

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 < MAXN; i++) {
		if (vec[i] > 1ll * v + L) {
			v = vec[i];
			ans++;
		}	
	}

	return ans - 1;
}

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	948 KB	Output is correct
3	Correct	4 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	948 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	6 ms	920 KB	Output is correct
5	Correct	5 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	948 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	6 ms	920 KB	Output is correct
5	Correct	5 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	4398 ms	2412 KB	Output is correct
8	Correct	3121 ms	2504 KB	Output is correct
9	Correct	2003 ms	2816 KB	Output is correct
10	Correct	2132 ms	3056 KB	Output is correct
11	Correct	1948 ms	2776 KB	Output is correct
12	Correct	6312 ms	2948 KB	Output is correct
13	Correct	2161 ms	2664 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	948 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	6 ms	920 KB	Output is correct
5	Correct	5 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	4398 ms	2412 KB	Output is correct
8	Correct	3121 ms	2504 KB	Output is correct
9	Correct	2003 ms	2816 KB	Output is correct
10	Correct	2132 ms	3056 KB	Output is correct
11	Correct	1948 ms	2776 KB	Output is correct
12	Correct	6312 ms	2948 KB	Output is correct
13	Correct	2161 ms	2664 KB	Output is correct
14	Correct	3902 ms	2948 KB	Output is correct
15	Correct	5570 ms	3068 KB	Output is correct
16	Execution timed out	9069 ms	3432 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	948 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	6 ms	920 KB	Output is correct
5	Correct	5 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	4398 ms	2412 KB	Output is correct
8	Correct	3121 ms	2504 KB	Output is correct
9	Correct	2003 ms	2816 KB	Output is correct
10	Correct	2132 ms	3056 KB	Output is correct
11	Correct	1948 ms	2776 KB	Output is correct
12	Correct	6312 ms	2948 KB	Output is correct
13	Correct	2161 ms	2664 KB	Output is correct
14	Correct	3902 ms	2948 KB	Output is correct
15	Correct	5570 ms	3068 KB	Output is correct
16	Execution timed out	9069 ms	3432 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-