oj.uz

Submission #761025

# Submission time Handle Problem Language Result Execution time Memory
761025 2023-06-19T04:57:41 Z SanguineChameleon Dancing Elephants (IOI11_elephants) C++17
100 / 100
 1795 ms 18972 KB 
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 1.5e5 + 20;
const int block_size = 400;
vector<int> pos[maxN];
vector<pair<int, int>> dp[maxN];
int A[maxN];
int N, L;
int block_cnt;

void calc_block(int id) {
	vector<int> &pos_block = pos[id];
	vector<pair<int, int>> &dp_block = dp[id];
	int sz = pos_block.size();
	dp_block.resize(sz);
	int rt = sz;
	for (int i = sz - 1; i >= 0; i--) {
		while (pos_block[rt - 1] > pos_block[i] + L) {
			rt--;
		}
		if (rt == sz) {
			dp_block[i].first = 1;
			dp_block[i].second = pos_block[i];
		}
		else {
			dp_block[i].first = dp_block[rt].first + 1;
			dp_block[i].second = dp_block[rt].second;
		}
	}
}

int calc_all() {
	int res = dp[0][0].first;
	int last = dp[0][0].second;
	for (int id = 1; id < block_cnt; id++) {
		if (pos[id].back() > last + L) {
			int i = upper_bound(pos[id].begin(), pos[id].end(), last + L) - pos[id].begin();
			res += dp[id][i].first;
			last = dp[id][i].second;
		}
	}
	return res;
}

void merge_blocks() {
	for (int id = 0; id < block_cnt - 1; id++) {
		if ((int)pos[id].size() + (int)pos[id + 1].size() < block_size * 2) {
			pos[id].insert(pos[id].end(), pos[id + 1].begin(), pos[id + 1].end());
			pos[id + 1].clear();
			dp[id + 1].clear();
			for (int i = id + 2; i < block_cnt; i++) {
				swap(pos[i - 1], pos[i]);
				swap(dp[i - 1], dp[i]);
			}
			block_cnt--;
			calc_block(id);
			merge_blocks();
			return;
		}
	}
}

void rem(int X) {
	int id = 0;
	while (pos[id].back() < X) {
		id++;
	}
	pos[id].erase(lower_bound(pos[id].begin(), pos[id].end(), X));
	if (pos[id].empty()) {
		for (int i = id + 1; i < block_cnt; i++) {
			swap(pos[i - 1], pos[i]);
			swap(dp[i - 1], dp[i]);
		}
		block_cnt--;
	}
	else {
		calc_block(id);
	}
	merge_blocks();
}

void add(int X) {
	int id = 0;
	while (id < block_cnt - 1 && pos[id].back() < X) {
		id++;
	}
	pos[id].insert(upper_bound(pos[id].begin(), pos[id].end(), X), X);
	if ((int)pos[id].size() == block_size * 2) {
		for (int i = block_cnt - 1; i > id; i--) {
			swap(pos[i + 1], pos[i]);
			swap(dp[i + 1], dp[i]);
		}
		pos[id + 1].insert(pos[id + 1].begin(), pos[id].begin() + block_size, pos[id].end());
		pos[id].erase(pos[id].begin() + block_size, pos[id].end());
		block_cnt++;
		calc_block(id);
		calc_block(id + 1);
	}
	else {
		calc_block(id);
	}
	merge_blocks();
}

void init(int _N, int _L, int _A[]) {
	N = _N;
	L = _L;
	block_cnt = (N - 1) / block_size + 1;
	for (int i = 0; i < N; i++) {
		A[i] = _A[i];
		pos[i / block_size].push_back(A[i]);
	}
	for (int id = 0; id < block_cnt; id++) {
		calc_block(id);
	}
}

int update(int i, int X) {
	rem(A[i]);
	A[i] = X;
	add(A[i]);
	return calc_all();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7308 KB Output is correct
7 Correct 148 ms 8372 KB Output is correct
8 Correct 156 ms 8536 KB Output is correct
9 Correct 252 ms 9580 KB Output is correct
10 Correct 218 ms 9608 KB Output is correct
11 Correct 174 ms 9576 KB Output is correct
12 Correct 361 ms 9580 KB Output is correct
13 Correct 191 ms 9632 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7308 KB Output is correct
7 Correct 148 ms 8372 KB Output is correct
8 Correct 156 ms 8536 KB Output is correct
9 Correct 252 ms 9580 KB Output is correct
10 Correct 218 ms 9608 KB Output is correct
11 Correct 174 ms 9576 KB Output is correct
12 Correct 361 ms 9580 KB Output is correct
13 Correct 191 ms 9632 KB Output is correct
14 Correct 230 ms 8784 KB Output is correct
15 Correct 184 ms 8952 KB Output is correct
16 Correct 683 ms 9804 KB Output is correct
17 Correct 622 ms 10488 KB Output is correct
18 Correct 690 ms 10400 KB Output is correct
19 Correct 272 ms 10408 KB Output is correct
20 Correct 623 ms 10532 KB Output is correct
21 Correct 545 ms 10536 KB Output is correct
22 Correct 314 ms 10444 KB Output is correct

Subtask #5
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7308 KB Output is correct
7 Correct 148 ms 8372 KB Output is correct
8 Correct 156 ms 8536 KB Output is correct
9 Correct 252 ms 9580 KB Output is correct
10 Correct 218 ms 9608 KB Output is correct
11 Correct 174 ms 9576 KB Output is correct
12 Correct 361 ms 9580 KB Output is correct
13 Correct 191 ms 9632 KB Output is correct
14 Correct 230 ms 8784 KB Output is correct
15 Correct 184 ms 8952 KB Output is correct
16 Correct 683 ms 9804 KB Output is correct
17 Correct 622 ms 10488 KB Output is correct
18 Correct 690 ms 10400 KB Output is correct
19 Correct 272 ms 10408 KB Output is correct
20 Correct 623 ms 10532 KB Output is correct
21 Correct 545 ms 10536 KB Output is correct
22 Correct 314 ms 10444 KB Output is correct
23 Correct 1442 ms 13980 KB Output is correct
24 Correct 1636 ms 13996 KB Output is correct
25 Correct 1306 ms 13984 KB Output is correct
26 Correct 1014 ms 14164 KB Output is correct
27 Correct 1000 ms 18936 KB Output is correct
28 Correct 990 ms 12212 KB Output is correct
29 Correct 880 ms 12212 KB Output is correct
30 Correct 977 ms 12220 KB Output is correct
31 Correct 877 ms 12308 KB Output is correct
32 Correct 861 ms 18564 KB Output is correct
33 Correct 790 ms 17940 KB Output is correct
34 Correct 1083 ms 18780 KB Output is correct
35 Correct 786 ms 17212 KB Output is correct
36 Correct 1111 ms 16704 KB Output is correct
37 Correct 1196 ms 18972 KB Output is correct
38 Correct 1103 ms 17780 KB Output is correct
39 Correct 919 ms 18680 KB Output is correct
40 Correct 1217 ms 17792 KB Output is correct
41 Correct 1746 ms 18588 KB Output is correct
42 Correct 1795 ms 18784 KB Output is correct