oj.uz

Submission #761026

# Submission time Handle Problem Language Result Execution time Memory
761026 2023-06-19T04:58:34 Z SanguineChameleon Dancing Elephants (IOI11_elephants) C++17
100 / 100
 1455 ms 14152 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 3 ms 7384 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 3 ms 7384 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 7380 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 3 ms 7384 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 7380 KB Output is correct
7 Correct 109 ms 8236 KB Output is correct
8 Correct 117 ms 8328 KB Output is correct
9 Correct 150 ms 9148 KB Output is correct
10 Correct 151 ms 9536 KB Output is correct
11 Correct 127 ms 9532 KB Output is correct
12 Correct 294 ms 9412 KB Output is correct
13 Correct 155 ms 9544 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 3 ms 7384 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 7380 KB Output is correct
7 Correct 109 ms 8236 KB Output is correct
8 Correct 117 ms 8328 KB Output is correct
9 Correct 150 ms 9148 KB Output is correct
10 Correct 151 ms 9536 KB Output is correct
11 Correct 127 ms 9532 KB Output is correct
12 Correct 294 ms 9412 KB Output is correct
13 Correct 155 ms 9544 KB Output is correct
14 Correct 162 ms 8980 KB Output is correct
15 Correct 203 ms 8844 KB Output is correct
16 Correct 545 ms 9632 KB Output is correct
17 Correct 492 ms 10552 KB Output is correct
18 Correct 548 ms 9924 KB Output is correct
19 Correct 212 ms 9644 KB Output is correct
20 Correct 481 ms 10348 KB Output is correct
21 Correct 451 ms 10232 KB Output is correct
22 Correct 267 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 3 ms 7384 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 7380 KB Output is correct
7 Correct 109 ms 8236 KB Output is correct
8 Correct 117 ms 8328 KB Output is correct
9 Correct 150 ms 9148 KB Output is correct
10 Correct 151 ms 9536 KB Output is correct
11 Correct 127 ms 9532 KB Output is correct
12 Correct 294 ms 9412 KB Output is correct
13 Correct 155 ms 9544 KB Output is correct
14 Correct 162 ms 8980 KB Output is correct
15 Correct 203 ms 8844 KB Output is correct
16 Correct 545 ms 9632 KB Output is correct
17 Correct 492 ms 10552 KB Output is correct
18 Correct 548 ms 9924 KB Output is correct
19 Correct 212 ms 9644 KB Output is correct
20 Correct 481 ms 10348 KB Output is correct
21 Correct 451 ms 10232 KB Output is correct
22 Correct 267 ms 10444 KB Output is correct
23 Correct 1093 ms 12920 KB Output is correct
24 Correct 1231 ms 13080 KB Output is correct
25 Correct 825 ms 12756 KB Output is correct
26 Correct 905 ms 14084 KB Output is correct
27 Correct 865 ms 12228 KB Output is correct
28 Correct 814 ms 9288 KB Output is correct
29 Correct 759 ms 9296 KB Output is correct
30 Correct 816 ms 9288 KB Output is correct
31 Correct 763 ms 9376 KB Output is correct
32 Correct 671 ms 14052 KB Output is correct
33 Correct 620 ms 14148 KB Output is correct
34 Correct 872 ms 14152 KB Output is correct
35 Correct 506 ms 12244 KB Output is correct
36 Correct 253 ms 12224 KB Output is correct
37 Correct 1042 ms 13332 KB Output is correct
38 Correct 960 ms 14048 KB Output is correct
39 Correct 733 ms 12232 KB Output is correct
40 Correct 1020 ms 14104 KB Output is correct
41 Correct 1445 ms 13860 KB Output is correct
42 Correct 1455 ms 13696 KB Output is correct