Submission #983339

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
983339	2024-05-15T10:31:29 Z	vjudge1	Sequence (APIO23_sequence)	C++17	28 / 100	2000 ms	1289960 KB

sequence

#include "sequence.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

pair<int, int> mids(int sz) {
	int m1 = sz / 2;
	int m2 = sz / 2 + (sz % 2);
	return {m1, m2};
}

int sequence(int N, std::vector<int> A) {
	int res = 0;
	vector<map<int, int>> p(A.size() + 1);
	for (size_t i = 0; i < A.size(); ++i) {
		for (auto [key, val]: p[i]) {
			p[i + 1][key] = val;
		}
		p[i + 1][A[i]]++;
	}
	for (int l = 0; l < (int)A.size(); ++l) {
		tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> st;
		for (int r = l; r < (int)A.size(); ++r) {
			st.insert(pair{A[r], r});
			auto [m1, m2] = mids(st.size() - 1);
			m1 = st.find_by_order(m1)->first;
			m2 = st.find_by_order(m2)->first;
			res = max(res, max(p[r + 1][m1] - p[l][m1], p[r + 1][m2] - p[l][m2]));
		}
	}
	return res;
}

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	2 ms	600 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	436 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	2 ms	604 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	2 ms	600 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	436 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	1089 ms	72092 KB	Output is correct
14	Correct	1062 ms	72108 KB	Output is correct
15	Correct	459 ms	4692 KB	Output is correct
16	Correct	463 ms	4732 KB	Output is correct
17	Correct	404 ms	1116 KB	Output is correct
18	Correct	1407 ms	144360 KB	Output is correct
19	Correct	1059 ms	62756 KB	Output is correct
20	Correct	1045 ms	58288 KB	Output is correct
21	Correct	1061 ms	61288 KB	Output is correct
22	Correct	1095 ms	61856 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	2104 ms	1228532 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	2027 ms	130448 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	2096 ms	1270692 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	2 ms	600 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	436 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	1089 ms	72092 KB	Output is correct
14	Correct	1062 ms	72108 KB	Output is correct
15	Correct	459 ms	4692 KB	Output is correct
16	Correct	463 ms	4732 KB	Output is correct
17	Correct	404 ms	1116 KB	Output is correct
18	Correct	1407 ms	144360 KB	Output is correct
19	Correct	1059 ms	62756 KB	Output is correct
20	Correct	1045 ms	58288 KB	Output is correct
21	Correct	1061 ms	61288 KB	Output is correct
22	Correct	1095 ms	61856 KB	Output is correct
23	Execution timed out	2120 ms	1289960 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	2 ms	600 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	436 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	1089 ms	72092 KB	Output is correct
14	Correct	1062 ms	72108 KB	Output is correct
15	Correct	459 ms	4692 KB	Output is correct
16	Correct	463 ms	4732 KB	Output is correct
17	Correct	404 ms	1116 KB	Output is correct
18	Correct	1407 ms	144360 KB	Output is correct
19	Correct	1059 ms	62756 KB	Output is correct
20	Correct	1045 ms	58288 KB	Output is correct
21	Correct	1061 ms	61288 KB	Output is correct
22	Correct	1095 ms	61856 KB	Output is correct
23	Execution timed out	2104 ms	1228532 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-