oj.uz

답안 #749200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
749200 2023-05-27T14:14:16 Z SanguineChameleon 서열 (APIO23_sequence) C++17
60 / 100
 648 ms 111852 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<node> pref[maxn];
vector<node> suf[maxn];
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++) {
			int lt = max(0, suf[i][j].mi - pref[i][j - (k - 1)].mx);
			int rt = min(k * 2, suf[i][j].mx - pref[i][j - (k - 1)].mi);
			if (lt <= rt) {
				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].push_back(get(1, 0, n, 0, p - 1));
			suf[i].push_back(get(1, 0, n, p, n));
		}
		for (auto p: pos[i]) {
			update(1, 0, n, p, n);
		}
	}
	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 34 ms 58956 KB Output is correct
2 Correct 30 ms 58996 KB Output is correct
3 Correct 37 ms 58984 KB Output is correct
4 Correct 36 ms 58956 KB Output is correct
5 Correct 32 ms 58964 KB Output is correct
6 Correct 29 ms 58900 KB Output is correct
7 Correct 28 ms 58932 KB Output is correct
8 Correct 33 ms 58908 KB Output is correct
9 Correct 35 ms 58964 KB Output is correct
10 Correct 29 ms 58924 KB Output is correct
11 Correct 29 ms 58928 KB Output is correct
12 Correct 28 ms 58996 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 58956 KB Output is correct
2 Correct 30 ms 58996 KB Output is correct
3 Correct 37 ms 58984 KB Output is correct
4 Correct 36 ms 58956 KB Output is correct
5 Correct 32 ms 58964 KB Output is correct
6 Correct 29 ms 58900 KB Output is correct
7 Correct 28 ms 58932 KB Output is correct
8 Correct 33 ms 58908 KB Output is correct
9 Correct 35 ms 58964 KB Output is correct
10 Correct 29 ms 58924 KB Output is correct
11 Correct 29 ms 58928 KB Output is correct
12 Correct 28 ms 58996 KB Output is correct
13 Correct 29 ms 59128 KB Output is correct
14 Correct 30 ms 59092 KB Output is correct
15 Correct 30 ms 59084 KB Output is correct
16 Correct 30 ms 58992 KB Output is correct
17 Correct 31 ms 59096 KB Output is correct
18 Correct 30 ms 59220 KB Output is correct
19 Correct 31 ms 59092 KB Output is correct
20 Correct 30 ms 59092 KB Output is correct
21 Correct 29 ms 59092 KB Output is correct
22 Correct 30 ms 59144 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 58956 KB Output is correct
2 Correct 510 ms 97300 KB Output is correct
3 Correct 546 ms 97200 KB Output is correct
4 Correct 424 ms 81060 KB Output is correct
5 Correct 511 ms 95584 KB Output is correct
6 Correct 493 ms 95576 KB Output is correct
7 Correct 436 ms 81060 KB Output is correct
8 Correct 476 ms 79848 KB Output is correct
9 Correct 406 ms 79532 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 58996 KB Output is correct
2 Correct 459 ms 80760 KB Output is correct
3 Correct 430 ms 81892 KB Output is correct
4 Correct 453 ms 82040 KB Output is correct
5 Correct 434 ms 82432 KB Output is correct
6 Correct 451 ms 79856 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 631 ms 111852 KB Output is correct
2 Correct 620 ms 111724 KB Output is correct
3 Correct 629 ms 110020 KB Output is correct
4 Correct 648 ms 110200 KB Output is correct
5 Correct 591 ms 100104 KB Output is correct
6 Correct 602 ms 100180 KB Output is correct
7 Correct 485 ms 96604 KB Output is correct
8 Correct 482 ms 95660 KB Output is correct

Subtask #6
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 58956 KB Output is correct
2 Correct 30 ms 58996 KB Output is correct
3 Correct 37 ms 58984 KB Output is correct
4 Correct 36 ms 58956 KB Output is correct
5 Correct 32 ms 58964 KB Output is correct
6 Correct 29 ms 58900 KB Output is correct
7 Correct 28 ms 58932 KB Output is correct
8 Correct 33 ms 58908 KB Output is correct
9 Correct 35 ms 58964 KB Output is correct
10 Correct 29 ms 58924 KB Output is correct
11 Correct 29 ms 58928 KB Output is correct
12 Correct 28 ms 58996 KB Output is correct
13 Correct 29 ms 59128 KB Output is correct
14 Correct 30 ms 59092 KB Output is correct
15 Correct 30 ms 59084 KB Output is correct
16 Correct 30 ms 58992 KB Output is correct
17 Correct 31 ms 59096 KB Output is correct
18 Correct 30 ms 59220 KB Output is correct
19 Correct 31 ms 59092 KB Output is correct
20 Correct 30 ms 59092 KB Output is correct
21 Correct 29 ms 59092 KB Output is correct
22 Correct 30 ms 59144 KB Output is correct
23 Correct 113 ms 65048 KB Output is correct
24 Correct 133 ms 65108 KB Output is correct
25 Correct 112 ms 65092 KB Output is correct
26 Correct 94 ms 63920 KB Output is correct
27 Correct 92 ms 63868 KB Output is correct
28 Correct 104 ms 63796 KB Output is correct
29 Correct 102 ms 62308 KB Output is correct
30 Correct 90 ms 62444 KB Output is correct
31 Correct 85 ms 63164 KB Output is correct
32 Correct 94 ms 67424 KB Output is correct
33 Correct 113 ms 64592 KB Output is correct
34 Correct 109 ms 64716 KB Output is correct
35 Correct 108 ms 64472 KB Output is correct
36 Incorrect 106 ms 64608 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 58956 KB Output is correct
2 Correct 30 ms 58996 KB Output is correct
3 Correct 37 ms 58984 KB Output is correct
4 Correct 36 ms 58956 KB Output is correct
5 Correct 32 ms 58964 KB Output is correct
6 Correct 29 ms 58900 KB Output is correct
7 Correct 28 ms 58932 KB Output is correct
8 Correct 33 ms 58908 KB Output is correct
9 Correct 35 ms 58964 KB Output is correct
10 Correct 29 ms 58924 KB Output is correct
11 Correct 29 ms 58928 KB Output is correct
12 Correct 28 ms 58996 KB Output is correct
13 Correct 29 ms 59128 KB Output is correct
14 Correct 30 ms 59092 KB Output is correct
15 Correct 30 ms 59084 KB Output is correct
16 Correct 30 ms 58992 KB Output is correct
17 Correct 31 ms 59096 KB Output is correct
18 Correct 30 ms 59220 KB Output is correct
19 Correct 31 ms 59092 KB Output is correct
20 Correct 30 ms 59092 KB Output is correct
21 Correct 29 ms 59092 KB Output is correct
22 Correct 30 ms 59144 KB Output is correct
23 Correct 510 ms 97300 KB Output is correct
24 Correct 546 ms 97200 KB Output is correct
25 Correct 424 ms 81060 KB Output is correct
26 Correct 511 ms 95584 KB Output is correct
27 Correct 493 ms 95576 KB Output is correct
28 Correct 436 ms 81060 KB Output is correct
29 Correct 476 ms 79848 KB Output is correct
30 Correct 406 ms 79532 KB Output is correct
31 Correct 459 ms 80760 KB Output is correct
32 Correct 430 ms 81892 KB Output is correct
33 Correct 453 ms 82040 KB Output is correct
34 Correct 434 ms 82432 KB Output is correct
35 Correct 451 ms 79856 KB Output is correct
36 Correct 631 ms 111852 KB Output is correct
37 Correct 620 ms 111724 KB Output is correct
38 Correct 629 ms 110020 KB Output is correct
39 Correct 648 ms 110200 KB Output is correct
40 Correct 591 ms 100104 KB Output is correct
41 Correct 602 ms 100180 KB Output is correct
42 Correct 485 ms 96604 KB Output is correct
43 Correct 482 ms 95660 KB Output is correct
44 Correct 113 ms 65048 KB Output is correct
45 Correct 133 ms 65108 KB Output is correct
46 Correct 112 ms 65092 KB Output is correct
47 Correct 94 ms 63920 KB Output is correct
48 Correct 92 ms 63868 KB Output is correct
49 Correct 104 ms 63796 KB Output is correct
50 Correct 102 ms 62308 KB Output is correct
51 Correct 90 ms 62444 KB Output is correct
52 Correct 85 ms 63164 KB Output is correct
53 Correct 94 ms 67424 KB Output is correct
54 Correct 113 ms 64592 KB Output is correct
55 Correct 109 ms 64716 KB Output is correct
56 Correct 108 ms 64472 KB Output is correct
57 Incorrect 106 ms 64608 KB Output isn't correct
58 Halted 0 ms 0 KB -