oj.uz

Submission #758503

# Submission time Handle Problem Language Result Execution time Memory
758503 2023-06-14T17:32:22 Z rainboy Sequence (APIO23_sequence) C++17
100 / 100
 698 ms 36752 KB 
#include "sequence.h"
#include <vector>

using namespace std;

typedef vector<int> vi;

const int N = 500000, N_ = 1 << 19;	/* N_ = pow2(ceil(log2(N + 1))) */

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int aa[N], ii[N], pp[N], qq[N], n;
int ss1[N_ * 2], pp1[N_ * 2], qq1[N_ * 2], ss2[N_ * 2], pp2[N_ * 2], qq2[N_ * 2], n_;

void pul(int *ss, int *pp, int *qq, int i) {
	int l = i << 1, r = l | 1;
	ss[i] = ss[l] + ss[r];
	pp[i] = max(pp[l], ss[l] + pp[r]);
	qq[i] = max(qq[l] + ss[r], qq[r]);
}

void build(int *ss, int *pp, int *qq, int x) {
	for (int i = 0; i < n_; i++)
		ss[n_ + i] = i < n ? x : 0, pp[n_ + i] = qq[n_ + i] = max(ss[n_ + i], 0);
	for (int i = n_ - 1; i > 0; i--)
		pul(ss, pp, qq, i);
}

void update(int *ss, int *pp, int *qq, int i, int x) {
	i += n_;
	ss[i] = x, pp[i] = qq[i] = max(x, 0);
	while (i > 1)
		pul(ss, pp, qq, i >>= 1);
}

int query_p(int *ss, int *pp, int r) {
	int l = 0, p = 0;
	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1)
		if ((r & 1) == 0)
			p = max(pp[r], ss[r] + p), r--;
	return p;
}

int query_q(int *ss, int *qq, int l) {
	int r = n_ - 1, q = 0;
	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1)
		if ((l & 1) == 1)
			q = max(q + ss[l], qq[l]), l++;
	return q;
}

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;
		while (j < k) {
			int c = aa[ii[j]] != aa[i_] ? aa[ii[j]] - aa[i_] : ii[j] - i_;

			if (c == 0)
				j++;
			else if (c < 0) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		}
		sort(ii, l, i);
		l = k;
	}
}

int sequence(int n1, vi aa_) {
	n = n1;
	n_ = 1;
	while (n_ <= n)
		n_ <<= 1;
	for (int i = 0; i < n; i++) {
		aa[i] = aa_[i];
		ii[i] = i;
	}
	sort(ii, 0, n);
	build(ss1, pp1, qq1, 1), build(ss2, pp2, qq2, -1);
	int ans = 0;
	for (int i = 0, j; i < n; i = j) {
		j = i + 1;
		while (j < n && aa[ii[j]] == aa[ii[i]])
			j++;
		for (int h = i; h < j; h++) {
			int i_ = ii[h];
			update(ss1, pp1, qq1, i_, -1);
		}
		if (j * 2 < n) {
			for (int h = i; h < j; h++)
				pp[h] = query_p(ss1, pp1, ii[h] - 1);
			for (int h = i; h < j; h++)
				qq[h] = query_q(ss1, qq1, ii[h] + 1);
			for (int h = i, h_ = i; h < j; h++) {
				while (h_ < j && pp[h] + qq[h_] >= n - j * 2)
					h_++;
				ans = max(ans, h_ - h);
			}
		} else if (i * 2 > n) {
			for (int h = i; h < j; h++)
				pp[h] = query_p(ss2, pp2, ii[h] - 1);
			for (int h = i; h < j; h++)
				qq[h] = query_q(ss2, qq2, ii[h] + 1);
			for (int h = i, h_ = i; h < j; h++) {
				while (h_ < j && pp[h] + qq[h_] >= i * 2 - n)
					h_++;
				ans = max(ans, h_ - h);
			}
		} else
			ans = max(ans, j - i);
		for (int h = i; h < j; h++) {
			int i_ = ii[h];
			update(ss2, pp2, qq2, i_, 1);
		}
	}
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 472 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 333 ms 36644 KB Output is correct
3 Correct 340 ms 36664 KB Output is correct
4 Correct 291 ms 35792 KB Output is correct
5 Correct 325 ms 36620 KB Output is correct
6 Correct 320 ms 36648 KB Output is correct
7 Correct 294 ms 36548 KB Output is correct
8 Correct 306 ms 36584 KB Output is correct
9 Correct 273 ms 35524 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 292 ms 34372 KB Output is correct
3 Correct 321 ms 35392 KB Output is correct
4 Correct 315 ms 35272 KB Output is correct
5 Correct 337 ms 34384 KB Output is correct
6 Correct 304 ms 36544 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 36636 KB Output is correct
2 Correct 501 ms 36544 KB Output is correct
3 Correct 490 ms 36532 KB Output is correct
4 Correct 466 ms 36528 KB Output is correct
5 Correct 401 ms 36632 KB Output is correct
6 Correct 455 ms 36556 KB Output is correct
7 Correct 336 ms 36564 KB Output is correct
8 Correct 385 ms 36676 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 472 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 82 ms 8360 KB Output is correct
24 Correct 74 ms 8476 KB Output is correct
25 Correct 78 ms 8344 KB Output is correct
26 Correct 66 ms 8392 KB Output is correct
27 Correct 63 ms 8296 KB Output is correct
28 Correct 62 ms 8308 KB Output is correct
29 Correct 51 ms 8280 KB Output is correct
30 Correct 61 ms 8160 KB Output is correct
31 Correct 42 ms 7732 KB Output is correct
32 Correct 52 ms 8352 KB Output is correct
33 Correct 66 ms 8364 KB Output is correct
34 Correct 78 ms 8396 KB Output is correct
35 Correct 66 ms 8376 KB Output is correct
36 Correct 67 ms 8364 KB Output is correct
37 Correct 64 ms 8336 KB Output is correct
38 Correct 73 ms 8344 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 472 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 333 ms 36644 KB Output is correct
24 Correct 340 ms 36664 KB Output is correct
25 Correct 291 ms 35792 KB Output is correct
26 Correct 325 ms 36620 KB Output is correct
27 Correct 320 ms 36648 KB Output is correct
28 Correct 294 ms 36548 KB Output is correct
29 Correct 306 ms 36584 KB Output is correct
30 Correct 273 ms 35524 KB Output is correct
31 Correct 292 ms 34372 KB Output is correct
32 Correct 321 ms 35392 KB Output is correct
33 Correct 315 ms 35272 KB Output is correct
34 Correct 337 ms 34384 KB Output is correct
35 Correct 304 ms 36544 KB Output is correct
36 Correct 458 ms 36636 KB Output is correct
37 Correct 501 ms 36544 KB Output is correct
38 Correct 490 ms 36532 KB Output is correct
39 Correct 466 ms 36528 KB Output is correct
40 Correct 401 ms 36632 KB Output is correct
41 Correct 455 ms 36556 KB Output is correct
42 Correct 336 ms 36564 KB Output is correct
43 Correct 385 ms 36676 KB Output is correct
44 Correct 82 ms 8360 KB Output is correct
45 Correct 74 ms 8476 KB Output is correct
46 Correct 78 ms 8344 KB Output is correct
47 Correct 66 ms 8392 KB Output is correct
48 Correct 63 ms 8296 KB Output is correct
49 Correct 62 ms 8308 KB Output is correct
50 Correct 51 ms 8280 KB Output is correct
51 Correct 61 ms 8160 KB Output is correct
52 Correct 42 ms 7732 KB Output is correct
53 Correct 52 ms 8352 KB Output is correct
54 Correct 66 ms 8364 KB Output is correct
55 Correct 78 ms 8396 KB Output is correct
56 Correct 66 ms 8376 KB Output is correct
57 Correct 67 ms 8364 KB Output is correct
58 Correct 64 ms 8336 KB Output is correct
59 Correct 73 ms 8344 KB Output is correct
60 Correct 698 ms 36592 KB Output is correct
61 Correct 629 ms 36668 KB Output is correct
62 Correct 651 ms 36660 KB Output is correct
63 Correct 614 ms 36524 KB Output is correct
64 Correct 532 ms 36636 KB Output is correct
65 Correct 548 ms 36676 KB Output is correct
66 Correct 348 ms 35972 KB Output is correct
67 Correct 356 ms 35776 KB Output is correct
68 Correct 260 ms 32704 KB Output is correct
69 Correct 331 ms 36612 KB Output is correct
70 Correct 568 ms 36608 KB Output is correct
71 Correct 659 ms 36752 KB Output is correct
72 Correct 543 ms 36604 KB Output is correct
73 Correct 598 ms 36552 KB Output is correct
74 Correct 549 ms 36640 KB Output is correct
75 Correct 543 ms 36616 KB Output is correct