Submission #976333

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
976333	2024-05-06T12:42:04 Z	MinaRagy06	Sequence (APIO23_sequence)	C++17	28 / 100	2000 ms	37880 KB

sequence

#include <bits/stdc++.h>
#include "sequence.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long
#define SZ(x) (int) x.size()

const int inf = 1e9;
int sequence(int n, vector<int> a) {
	vector<int> gud[n + 1];
	for (int i = 0; i <= n; i++) {
		gud[i].push_back(-1);
	}
	for (int i = 0; i < n; i++) {
		gud[a[i]].push_back(i);
	}
	for (int i = 0; i <= n; i++) {
		gud[i].push_back(n);
	}
	int ans = 0;
	for (int i = 0; i <= n; i++) {
		int suf[n + 1]{};
		for (int j = n - 1; j >= 0; j--) {
			suf[j] = suf[j + 1] + (a[j] < i? -1 : 0) + (a[j] > i? 1 : 0);
		}
		array<int, 2> vl[SZ(gud[i]) - 1];
		for (int j = 1; j < SZ(gud[i]) - 1; j++) {
			vl[j] = {inf, -inf};
			for (int k = gud[i][j - 1] + 1; k <= gud[i][j]; k++) {
				vl[j][0] = min(vl[j][0], suf[k]);
				vl[j][1] = max(vl[j][1], suf[k]);
			}
		}
		for (int r = SZ(gud[i]) - 2; r >= 1; r--) {
			array<int, 2> vr = {inf, -inf};
			for (int k = gud[i][r] + 1; k <= gud[i][r + 1]; k++) {
				vr[0] = min(vr[0], suf[k]);
				vr[1] = max(vr[1], suf[k]);
			}
			for (int l = 1; l <= r; l++) {
				if (vr[0] <= vl[l][0]) {
					if (vl[l][0] + l <= r + vr[1] + 1) {
						ans = max(ans, r - l + 1);
						break;
					}
				} else {
					if (l - vl[l][1] <= r - vr[0] + 1) {
						ans = max(ans, r - l + 1);
					}
				}
			}
		}
	}
	return ans;
}

Subtask #1

11.0 / 11.0

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

Subtask #2

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	436 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	15 ms	576 KB	Output is correct
14	Correct	15 ms	348 KB	Output is correct
15	Correct	12 ms	344 KB	Output is correct
16	Correct	12 ms	348 KB	Output is correct
17	Correct	12 ms	348 KB	Output is correct
18	Correct	16 ms	580 KB	Output is correct
19	Correct	15 ms	432 KB	Output is correct
20	Correct	15 ms	348 KB	Output is correct
21	Correct	14 ms	348 KB	Output is correct
22	Correct	14 ms	580 KB	Output is correct

Subtask #3

0.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	2032 ms	35408 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	2056 ms	37880 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2044 ms	33540 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	436 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	15 ms	576 KB	Output is correct
14	Correct	15 ms	348 KB	Output is correct
15	Correct	12 ms	344 KB	Output is correct
16	Correct	12 ms	348 KB	Output is correct
17	Correct	12 ms	348 KB	Output is correct
18	Correct	16 ms	580 KB	Output is correct
19	Correct	15 ms	432 KB	Output is correct
20	Correct	15 ms	348 KB	Output is correct
21	Correct	14 ms	348 KB	Output is correct
22	Correct	14 ms	580 KB	Output is correct
23	Execution timed out	2009 ms	6520 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #7

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	436 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	15 ms	576 KB	Output is correct
14	Correct	15 ms	348 KB	Output is correct
15	Correct	12 ms	344 KB	Output is correct
16	Correct	12 ms	348 KB	Output is correct
17	Correct	12 ms	348 KB	Output is correct
18	Correct	16 ms	580 KB	Output is correct
19	Correct	15 ms	432 KB	Output is correct
20	Correct	15 ms	348 KB	Output is correct
21	Correct	14 ms	348 KB	Output is correct
22	Correct	14 ms	580 KB	Output is correct
23	Execution timed out	2032 ms	35408 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-