oj.uz

Submission #881662

# Submission time Handle Problem Language Result Execution time Memory
881662 2023-12-01T17:36:15 Z tsumondai Sequence (APIO23_sequence) C++17
100 / 100
 883 ms 170008 KB 
/*
给定序列n。 调用 res 来计算 x 在段 l,r 中出现的次数（x 是段 l,r 中的中位数 - 可以有 2 个中位数）。 求任意线段 l,r 的最大分辨率。
Given sequence n. Call res the number of times x appears in segment l,r, (x is the median number in segment l,r - there can be 2 medians). Find the maximum res for any segment l,r.
Cho dãy n. Gọi res số số lần xuất hiện của x trong đoạn l,r, (x là số median trong đoạn l,r - có thể có 2 median). Tìm res lớn nhất với đoạn l,r bất kì.
*/
#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
 
struct node {
	int mi, mx, lazy;
 
	node(): mi(0), mx(0), lazy(0) {};
 
	node(int _mi, int _mx): mi(_mi), mx(_mx), lazy(0) {};
};
 
const int maxn = 5e5 + 20;
int a[maxn];
vector<int> pos[maxn];
vector<int> pref[maxn][2];
vector<int> suf[maxn][2];
node tree[maxn * 4];
int n;
 
node merge(node L, node R) {
	return node(min(L.mi, R.mi), max(L.mx, R.mx));
}
 
void build(int id, int lt, int rt) {
	if (lt == rt) {
		tree[id] = node(lt, lt);
		return;
	}
	int mt = (lt + rt) / 2;
	build(id * 2, lt, mt);
	build(id * 2 + 1, mt + 1, rt);
	tree[id] = merge(tree[id * 2], tree[id * 2 + 1]);
}
 
void push(int id) {
	tree[id * 2].lazy += tree[id].lazy;
	tree[id * 2].mi += tree[id].lazy;
	tree[id * 2].mx += tree[id].lazy;
	tree[id * 2 + 1].lazy += tree[id].lazy;
	tree[id * 2 + 1].mi += tree[id].lazy;
	tree[id * 2 + 1].mx += tree[id].lazy;
	tree[id].lazy = 0;
}
 
 
void update(int id, int lt, int rt, int ql, int qr) {
	if (lt == ql && rt == qr) {
		tree[id].lazy -= 2;
		tree[id].mi -= 2;
		tree[id].mx -= 2;
		return;
	}
	push(id);
	int mt = (lt + rt) / 2;
	if (qr <= mt) {
		update(id * 2, lt, mt, ql, qr);
	}
	else if (ql >= mt + 1) {
		update(id * 2 + 1, mt + 1, rt, ql, qr);
	}
	else {
		update(id * 2, lt, mt, ql, mt);
		update(id * 2 + 1, mt + 1, rt, mt + 1, qr);
	}
	tree[id] = merge(tree[id * 2], tree[id * 2 + 1]);
}
 
node get(int id, int lt, int rt, int ql, int qr) {
	if (lt == ql && rt == qr) {
		return tree[id];
	}
	push(id);
	int mt = (lt + rt) / 2;
	if (qr <= mt) {
		return get(id * 2, lt, mt, ql, qr);
	}
	else if (ql >= mt + 1) {
		return get(id * 2 + 1, mt + 1, rt, ql, qr);
	}
	else {
		return merge(get(id * 2, lt, mt, ql, mt), get(id * 2 + 1, mt + 1, rt, mt + 1, qr));
	}
}
 
bool check(int k) {
	for (int i = 1; i <= n; i++) {
		for (int j = k - 1; j < (int)pos[i].size(); j++) {
			if (suf[i][0][j] >= pref[i][0][j - (k - 1)] && suf[i][1][j] <= pref[i][1][j - (k - 1)]) {
				return true;
			}
		}
	}
	return false;
}
 
int sequence(int _N, vector<int> _A) {
	n = _N;
	for (int i = 1; i <= n; i++) {
		a[i] = _A[i - 1];
	}
	for (int i = 1; i <= n; i++) {
		pos[a[i]].push_back(i);
	}
	build(1, 0, n);
	for (int i = 1; i <= n; i++) {
		for (auto p: pos[i]) {
			pref[i][0].push_back(get(1, 0, n, 0, p - 1).mi);
			suf[i][0].push_back(get(1, 0, n, p, n).mx);
		}
		for (auto p: pos[i]) {
			update(1, 0, n, p, n);
		}
		for (auto p: pos[i]) {
			pref[i][1].push_back(get(1, 0, n, 0, p - 1).mx);
			suf[i][1].push_back(get(1, 0, n, p, n).mi);
		}
	}
	int res = 1;
	int lt = 1;
	int rt = n;
	while (lt <= rt) {
		int mt = (lt + rt) / 2;
		if (check(mt)) {
			res = mt;
			lt = mt + 1;
		}
		else {
			rt = mt - 1;
		}
	}
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 82512 KB Output is correct
2 Correct 20 ms 82524 KB Output is correct
3 Correct 17 ms 82524 KB Output is correct
4 Correct 18 ms 82524 KB Output is correct
5 Correct 18 ms 82524 KB Output is correct
6 Correct 22 ms 82524 KB Output is correct
7 Correct 19 ms 82520 KB Output is correct
8 Correct 18 ms 82652 KB Output is correct
9 Correct 18 ms 82520 KB Output is correct
10 Correct 17 ms 82524 KB Output is correct
11 Correct 19 ms 82520 KB Output is correct
12 Correct 18 ms 82524 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 82512 KB Output is correct
2 Correct 20 ms 82524 KB Output is correct
3 Correct 17 ms 82524 KB Output is correct
4 Correct 18 ms 82524 KB Output is correct
5 Correct 18 ms 82524 KB Output is correct
6 Correct 22 ms 82524 KB Output is correct
7 Correct 19 ms 82520 KB Output is correct
8 Correct 18 ms 82652 KB Output is correct
9 Correct 18 ms 82520 KB Output is correct
10 Correct 17 ms 82524 KB Output is correct
11 Correct 19 ms 82520 KB Output is correct
12 Correct 18 ms 82524 KB Output is correct
13 Correct 20 ms 82780 KB Output is correct
14 Correct 22 ms 82776 KB Output is correct
15 Correct 19 ms 82920 KB Output is correct
16 Correct 22 ms 82676 KB Output is correct
17 Correct 19 ms 82524 KB Output is correct
18 Correct 20 ms 83036 KB Output is correct
19 Correct 21 ms 82780 KB Output is correct
20 Correct 22 ms 82776 KB Output is correct
21 Correct 20 ms 82780 KB Output is correct
22 Correct 20 ms 82776 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 82512 KB Output is correct
2 Correct 625 ms 141224 KB Output is correct
3 Correct 633 ms 141396 KB Output is correct
4 Correct 523 ms 100628 KB Output is correct
5 Correct 607 ms 136524 KB Output is correct
6 Correct 610 ms 136528 KB Output is correct
7 Correct 527 ms 101152 KB Output is correct
8 Correct 554 ms 101332 KB Output is correct
9 Correct 534 ms 99780 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 82524 KB Output is correct
2 Correct 536 ms 100676 KB Output is correct
3 Correct 549 ms 100244 KB Output is correct
4 Correct 542 ms 100284 KB Output is correct
5 Correct 542 ms 103608 KB Output is correct
6 Correct 552 ms 99708 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 779 ms 169864 KB Output is correct
2 Correct 760 ms 170008 KB Output is correct
3 Correct 789 ms 166944 KB Output is correct
4 Correct 777 ms 167056 KB Output is correct
5 Correct 693 ms 150276 KB Output is correct
6 Correct 678 ms 150292 KB Output is correct
7 Correct 594 ms 144432 KB Output is correct
8 Correct 586 ms 142672 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 82512 KB Output is correct
2 Correct 20 ms 82524 KB Output is correct
3 Correct 17 ms 82524 KB Output is correct
4 Correct 18 ms 82524 KB Output is correct
5 Correct 18 ms 82524 KB Output is correct
6 Correct 22 ms 82524 KB Output is correct
7 Correct 19 ms 82520 KB Output is correct
8 Correct 18 ms 82652 KB Output is correct
9 Correct 18 ms 82520 KB Output is correct
10 Correct 17 ms 82524 KB Output is correct
11 Correct 19 ms 82520 KB Output is correct
12 Correct 18 ms 82524 KB Output is correct
13 Correct 20 ms 82780 KB Output is correct
14 Correct 22 ms 82776 KB Output is correct
15 Correct 19 ms 82920 KB Output is correct
16 Correct 22 ms 82676 KB Output is correct
17 Correct 19 ms 82524 KB Output is correct
18 Correct 20 ms 83036 KB Output is correct
19 Correct 21 ms 82780 KB Output is correct
20 Correct 22 ms 82776 KB Output is correct
21 Correct 20 ms 82780 KB Output is correct
22 Correct 20 ms 82776 KB Output is correct
23 Correct 120 ms 91768 KB Output is correct
24 Correct 120 ms 91732 KB Output is correct
25 Correct 121 ms 91936 KB Output is correct
26 Correct 100 ms 86612 KB Output is correct
27 Correct 100 ms 86644 KB Output is correct
28 Correct 105 ms 86520 KB Output is correct
29 Correct 93 ms 85280 KB Output is correct
30 Correct 93 ms 85332 KB Output is correct
31 Correct 102 ms 86216 KB Output is correct
32 Correct 107 ms 96380 KB Output is correct
33 Correct 119 ms 90964 KB Output is correct
34 Correct 118 ms 90844 KB Output is correct
35 Correct 126 ms 90704 KB Output is correct
36 Correct 122 ms 90928 KB Output is correct
37 Correct 120 ms 90808 KB Output is correct
38 Correct 123 ms 91068 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 82512 KB Output is correct
2 Correct 20 ms 82524 KB Output is correct
3 Correct 17 ms 82524 KB Output is correct
4 Correct 18 ms 82524 KB Output is correct
5 Correct 18 ms 82524 KB Output is correct
6 Correct 22 ms 82524 KB Output is correct
7 Correct 19 ms 82520 KB Output is correct
8 Correct 18 ms 82652 KB Output is correct
9 Correct 18 ms 82520 KB Output is correct
10 Correct 17 ms 82524 KB Output is correct
11 Correct 19 ms 82520 KB Output is correct
12 Correct 18 ms 82524 KB Output is correct
13 Correct 20 ms 82780 KB Output is correct
14 Correct 22 ms 82776 KB Output is correct
15 Correct 19 ms 82920 KB Output is correct
16 Correct 22 ms 82676 KB Output is correct
17 Correct 19 ms 82524 KB Output is correct
18 Correct 20 ms 83036 KB Output is correct
19 Correct 21 ms 82780 KB Output is correct
20 Correct 22 ms 82776 KB Output is correct
21 Correct 20 ms 82780 KB Output is correct
22 Correct 20 ms 82776 KB Output is correct
23 Correct 625 ms 141224 KB Output is correct
24 Correct 633 ms 141396 KB Output is correct
25 Correct 523 ms 100628 KB Output is correct
26 Correct 607 ms 136524 KB Output is correct
27 Correct 610 ms 136528 KB Output is correct
28 Correct 527 ms 101152 KB Output is correct
29 Correct 554 ms 101332 KB Output is correct
30 Correct 534 ms 99780 KB Output is correct
31 Correct 536 ms 100676 KB Output is correct
32 Correct 549 ms 100244 KB Output is correct
33 Correct 542 ms 100284 KB Output is correct
34 Correct 542 ms 103608 KB Output is correct
35 Correct 552 ms 99708 KB Output is correct
36 Correct 779 ms 169864 KB Output is correct
37 Correct 760 ms 170008 KB Output is correct
38 Correct 789 ms 166944 KB Output is correct
39 Correct 777 ms 167056 KB Output is correct
40 Correct 693 ms 150276 KB Output is correct
41 Correct 678 ms 150292 KB Output is correct
42 Correct 594 ms 144432 KB Output is correct
43 Correct 586 ms 142672 KB Output is correct
44 Correct 120 ms 91768 KB Output is correct
45 Correct 120 ms 91732 KB Output is correct
46 Correct 121 ms 91936 KB Output is correct
47 Correct 100 ms 86612 KB Output is correct
48 Correct 100 ms 86644 KB Output is correct
49 Correct 105 ms 86520 KB Output is correct
50 Correct 93 ms 85280 KB Output is correct
51 Correct 93 ms 85332 KB Output is correct
52 Correct 102 ms 86216 KB Output is correct
53 Correct 107 ms 96380 KB Output is correct
54 Correct 119 ms 90964 KB Output is correct
55 Correct 118 ms 90844 KB Output is correct
56 Correct 126 ms 90704 KB Output is correct
57 Correct 122 ms 90928 KB Output is correct
58 Correct 120 ms 90808 KB Output is correct
59 Correct 123 ms 91068 KB Output is correct
60 Correct 824 ms 141172 KB Output is correct
61 Correct 837 ms 141224 KB Output is correct
62 Correct 853 ms 141316 KB Output is correct
63 Correct 652 ms 104896 KB Output is correct
64 Correct 632 ms 105264 KB Output is correct
65 Correct 615 ms 105040 KB Output is correct
66 Correct 538 ms 100804 KB Output is correct
67 Correct 549 ms 100640 KB Output is correct
68 Correct 532 ms 103272 KB Output is correct
69 Correct 605 ms 169852 KB Output is correct
70 Correct 778 ms 136812 KB Output is correct
71 Correct 805 ms 136308 KB Output is correct
72 Correct 789 ms 133976 KB Output is correct
73 Correct 883 ms 135432 KB Output is correct
74 Correct 773 ms 133644 KB Output is correct
75 Correct 842 ms 135636 KB Output is correct