oj.uz

답안 #749215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
749215 2023-05-27T14:49:07 Z SanguineChameleon 서열 (APIO23_sequence) C++17
100 / 100
 1039 ms 166776 KB 
#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

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 82380 KB Output is correct
2 Correct 44 ms 82484 KB Output is correct
3 Correct 38 ms 82380 KB Output is correct
4 Correct 43 ms 82496 KB Output is correct
5 Correct 37 ms 82380 KB Output is correct
6 Correct 38 ms 82508 KB Output is correct
7 Correct 38 ms 82432 KB Output is correct
8 Correct 41 ms 82500 KB Output is correct
9 Correct 40 ms 82380 KB Output is correct
10 Correct 40 ms 82408 KB Output is correct
11 Correct 46 ms 82492 KB Output is correct
12 Correct 38 ms 82380 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 82380 KB Output is correct
2 Correct 44 ms 82484 KB Output is correct
3 Correct 38 ms 82380 KB Output is correct
4 Correct 43 ms 82496 KB Output is correct
5 Correct 37 ms 82380 KB Output is correct
6 Correct 38 ms 82508 KB Output is correct
7 Correct 38 ms 82432 KB Output is correct
8 Correct 41 ms 82500 KB Output is correct
9 Correct 40 ms 82380 KB Output is correct
10 Correct 40 ms 82408 KB Output is correct
11 Correct 46 ms 82492 KB Output is correct
12 Correct 38 ms 82380 KB Output is correct
13 Correct 41 ms 82684 KB Output is correct
14 Correct 42 ms 82644 KB Output is correct
15 Correct 40 ms 82476 KB Output is correct
16 Correct 43 ms 82552 KB Output is correct
17 Correct 40 ms 82516 KB Output is correct
18 Correct 46 ms 82772 KB Output is correct
19 Correct 39 ms 82636 KB Output is correct
20 Correct 39 ms 82680 KB Output is correct
21 Correct 38 ms 82620 KB Output is correct
22 Correct 40 ms 82592 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 82380 KB Output is correct
2 Correct 790 ms 137992 KB Output is correct
3 Correct 914 ms 138068 KB Output is correct
4 Correct 687 ms 99724 KB Output is correct
5 Correct 760 ms 133396 KB Output is correct
6 Correct 759 ms 133256 KB Output is correct
7 Correct 643 ms 99672 KB Output is correct
8 Correct 668 ms 99992 KB Output is correct
9 Correct 658 ms 98740 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 82484 KB Output is correct
2 Correct 730 ms 99608 KB Output is correct
3 Correct 671 ms 99280 KB Output is correct
4 Correct 722 ms 99268 KB Output is correct
5 Correct 688 ms 102544 KB Output is correct
6 Correct 665 ms 98688 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 904 ms 166628 KB Output is correct
2 Correct 925 ms 166632 KB Output is correct
3 Correct 911 ms 163816 KB Output is correct
4 Correct 994 ms 163708 KB Output is correct
5 Correct 875 ms 146968 KB Output is correct
6 Correct 870 ms 147124 KB Output is correct
7 Correct 762 ms 141132 KB Output is correct
8 Correct 726 ms 139584 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 82380 KB Output is correct
2 Correct 44 ms 82484 KB Output is correct
3 Correct 38 ms 82380 KB Output is correct
4 Correct 43 ms 82496 KB Output is correct
5 Correct 37 ms 82380 KB Output is correct
6 Correct 38 ms 82508 KB Output is correct
7 Correct 38 ms 82432 KB Output is correct
8 Correct 41 ms 82500 KB Output is correct
9 Correct 40 ms 82380 KB Output is correct
10 Correct 40 ms 82408 KB Output is correct
11 Correct 46 ms 82492 KB Output is correct
12 Correct 38 ms 82380 KB Output is correct
13 Correct 41 ms 82684 KB Output is correct
14 Correct 42 ms 82644 KB Output is correct
15 Correct 40 ms 82476 KB Output is correct
16 Correct 43 ms 82552 KB Output is correct
17 Correct 40 ms 82516 KB Output is correct
18 Correct 46 ms 82772 KB Output is correct
19 Correct 39 ms 82636 KB Output is correct
20 Correct 39 ms 82680 KB Output is correct
21 Correct 38 ms 82620 KB Output is correct
22 Correct 40 ms 82592 KB Output is correct
23 Correct 167 ms 91264 KB Output is correct
24 Correct 171 ms 91268 KB Output is correct
25 Correct 195 ms 91272 KB Output is correct
26 Correct 142 ms 86184 KB Output is correct
27 Correct 160 ms 86256 KB Output is correct
28 Correct 156 ms 86196 KB Output is correct
29 Correct 141 ms 85068 KB Output is correct
30 Correct 137 ms 85092 KB Output is correct
31 Correct 140 ms 85756 KB Output is correct
32 Correct 138 ms 95940 KB Output is correct
33 Correct 154 ms 90360 KB Output is correct
34 Correct 158 ms 90412 KB Output is correct
35 Correct 154 ms 90168 KB Output is correct
36 Correct 158 ms 90236 KB Output is correct
37 Correct 170 ms 90232 KB Output is correct
38 Correct 159 ms 90448 KB Output is correct

Subtask #7
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 82380 KB Output is correct
2 Correct 44 ms 82484 KB Output is correct
3 Correct 38 ms 82380 KB Output is correct
4 Correct 43 ms 82496 KB Output is correct
5 Correct 37 ms 82380 KB Output is correct
6 Correct 38 ms 82508 KB Output is correct
7 Correct 38 ms 82432 KB Output is correct
8 Correct 41 ms 82500 KB Output is correct
9 Correct 40 ms 82380 KB Output is correct
10 Correct 40 ms 82408 KB Output is correct
11 Correct 46 ms 82492 KB Output is correct
12 Correct 38 ms 82380 KB Output is correct
13 Correct 41 ms 82684 KB Output is correct
14 Correct 42 ms 82644 KB Output is correct
15 Correct 40 ms 82476 KB Output is correct
16 Correct 43 ms 82552 KB Output is correct
17 Correct 40 ms 82516 KB Output is correct
18 Correct 46 ms 82772 KB Output is correct
19 Correct 39 ms 82636 KB Output is correct
20 Correct 39 ms 82680 KB Output is correct
21 Correct 38 ms 82620 KB Output is correct
22 Correct 40 ms 82592 KB Output is correct
23 Correct 790 ms 137992 KB Output is correct
24 Correct 914 ms 138068 KB Output is correct
25 Correct 687 ms 99724 KB Output is correct
26 Correct 760 ms 133396 KB Output is correct
27 Correct 759 ms 133256 KB Output is correct
28 Correct 643 ms 99672 KB Output is correct
29 Correct 668 ms 99992 KB Output is correct
30 Correct 658 ms 98740 KB Output is correct
31 Correct 730 ms 99608 KB Output is correct
32 Correct 671 ms 99280 KB Output is correct
33 Correct 722 ms 99268 KB Output is correct
34 Correct 688 ms 102544 KB Output is correct
35 Correct 665 ms 98688 KB Output is correct
36 Correct 904 ms 166628 KB Output is correct
37 Correct 925 ms 166632 KB Output is correct
38 Correct 911 ms 163816 KB Output is correct
39 Correct 994 ms 163708 KB Output is correct
40 Correct 875 ms 146968 KB Output is correct
41 Correct 870 ms 147124 KB Output is correct
42 Correct 762 ms 141132 KB Output is correct
43 Correct 726 ms 139584 KB Output is correct
44 Correct 167 ms 91264 KB Output is correct
45 Correct 171 ms 91268 KB Output is correct
46 Correct 195 ms 91272 KB Output is correct
47 Correct 142 ms 86184 KB Output is correct
48 Correct 160 ms 86256 KB Output is correct
49 Correct 156 ms 86196 KB Output is correct
50 Correct 141 ms 85068 KB Output is correct
51 Correct 137 ms 85092 KB Output is correct
52 Correct 140 ms 85756 KB Output is correct
53 Correct 138 ms 95940 KB Output is correct
54 Correct 154 ms 90360 KB Output is correct
55 Correct 158 ms 90412 KB Output is correct
56 Correct 154 ms 90168 KB Output is correct
57 Correct 158 ms 90236 KB Output is correct
58 Correct 170 ms 90232 KB Output is correct
59 Correct 159 ms 90448 KB Output is correct
60 Correct 1039 ms 137972 KB Output is correct
61 Correct 992 ms 137928 KB Output is correct
62 Correct 984 ms 137920 KB Output is correct
63 Correct 775 ms 103072 KB Output is correct
64 Correct 780 ms 102860 KB Output is correct
65 Correct 844 ms 103108 KB Output is correct
66 Correct 685 ms 99768 KB Output is correct
67 Correct 673 ms 99752 KB Output is correct
68 Correct 674 ms 99692 KB Output is correct
69 Correct 724 ms 166776 KB Output is correct
70 Correct 942 ms 133300 KB Output is correct
71 Correct 924 ms 132984 KB Output is correct
72 Correct 967 ms 130536 KB Output is correct
73 Correct 1002 ms 132160 KB Output is correct
74 Correct 995 ms 130108 KB Output is correct
75 Correct 968 ms 132268 KB Output is correct