답안 #799947

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799947	2023-08-01T08:45:16 Z	Sohsoh84	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	50 / 100	9000 ms	3172 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(-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

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct

Subtask #2

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	5 ms	976 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

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	5 ms	976 KB	Output is correct
5	Correct	5 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	3702 ms	2424 KB	Output is correct
8	Correct	3148 ms	2372 KB	Output is correct
9	Correct	1689 ms	3172 KB	Output is correct
10	Correct	1851 ms	2756 KB	Output is correct
11	Correct	1838 ms	2904 KB	Output is correct
12	Correct	6117 ms	2888 KB	Output is correct
13	Correct	2047 ms	2896 KB	Output is correct

Subtask #4

0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	5 ms	976 KB	Output is correct
5	Correct	5 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	3702 ms	2424 KB	Output is correct
8	Correct	3148 ms	2372 KB	Output is correct
9	Correct	1689 ms	3172 KB	Output is correct
10	Correct	1851 ms	2756 KB	Output is correct
11	Correct	1838 ms	2904 KB	Output is correct
12	Correct	6117 ms	2888 KB	Output is correct
13	Correct	2047 ms	2896 KB	Output is correct
14	Correct	3256 ms	2960 KB	Output is correct
15	Correct	4974 ms	3016 KB	Output is correct
16	Execution timed out	9056 ms	3172 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	976 KB	Output is correct
2	Correct	3 ms	976 KB	Output is correct
3	Correct	4 ms	976 KB	Output is correct
4	Correct	5 ms	976 KB	Output is correct
5	Correct	5 ms	976 KB	Output is correct
6	Correct	4 ms	976 KB	Output is correct
7	Correct	3702 ms	2424 KB	Output is correct
8	Correct	3148 ms	2372 KB	Output is correct
9	Correct	1689 ms	3172 KB	Output is correct
10	Correct	1851 ms	2756 KB	Output is correct
11	Correct	1838 ms	2904 KB	Output is correct
12	Correct	6117 ms	2888 KB	Output is correct
13	Correct	2047 ms	2896 KB	Output is correct
14	Correct	3256 ms	2960 KB	Output is correct
15	Correct	4974 ms	3016 KB	Output is correct
16	Execution timed out	9056 ms	3172 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-