Submission #758045

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
758045	2023-06-14T05:40:01 Z	tkm_algorithms	Sequence (APIO23_sequence)	C++17	28 / 100	2000 ms	60944 KB

sequence

#include "bits/stdc++.h"
#include "sequence.h"

using namespace std;
using ll = long long;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
typedef pair<int, int> node;
typedef tree<node, null_type, less<node>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
    

int sequence(int N, std::vector<int> A) {
	int n = N;
	vector<int> a = A;
	int ans = 0;
	for (int i = 0; i < n; i++) {
		ordered_set setik;
		map<int, int> mp;
		for (int j = i; j < n; j++) {
			setik.insert({a[j], j});
			mp[a[j]]++;
			int x = (*setik.find_by_order((j - i) / 2)).first;
			ans = max(ans, mp[x]);
			if ((j - i + 1) % 2 == 0) {
				int x = (*setik.find_by_order((j - i) / 2 + 1)).first;
				ans = max(ans, mp[x]);
			}
		}
	}
	return ans;
}

Subtask #1

11.0 / 11.0

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

Subtask #2

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	2 ms	304 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	2 ms	212 KB	Output is correct
10	Correct	2 ms	212 KB	Output is correct
11	Correct	2 ms	212 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	789 ms	480 KB	Output is correct
14	Correct	762 ms	488 KB	Output is correct
15	Correct	577 ms	424 KB	Output is correct
16	Correct	566 ms	460 KB	Output is correct
17	Correct	501 ms	428 KB	Output is correct
18	Correct	634 ms	528 KB	Output is correct
19	Correct	762 ms	476 KB	Output is correct
20	Correct	749 ms	468 KB	Output is correct
21	Correct	778 ms	476 KB	Output is correct
22	Correct	799 ms	476 KB	Output is correct

Subtask #3

0.0 / 7.0

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

Subtask #4

0.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Execution timed out	2061 ms	37588 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	2063 ms	60944 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	2 ms	304 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	2 ms	212 KB	Output is correct
10	Correct	2 ms	212 KB	Output is correct
11	Correct	2 ms	212 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	789 ms	480 KB	Output is correct
14	Correct	762 ms	488 KB	Output is correct
15	Correct	577 ms	424 KB	Output is correct
16	Correct	566 ms	460 KB	Output is correct
17	Correct	501 ms	428 KB	Output is correct
18	Correct	634 ms	528 KB	Output is correct
19	Correct	762 ms	476 KB	Output is correct
20	Correct	749 ms	468 KB	Output is correct
21	Correct	778 ms	476 KB	Output is correct
22	Correct	799 ms	476 KB	Output is correct
23	Execution timed out	2059 ms	8532 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #7

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	2 ms	304 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	2 ms	212 KB	Output is correct
10	Correct	2 ms	212 KB	Output is correct
11	Correct	2 ms	212 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	789 ms	480 KB	Output is correct
14	Correct	762 ms	488 KB	Output is correct
15	Correct	577 ms	424 KB	Output is correct
16	Correct	566 ms	460 KB	Output is correct
17	Correct	501 ms	428 KB	Output is correct
18	Correct	634 ms	528 KB	Output is correct
19	Correct	762 ms	476 KB	Output is correct
20	Correct	749 ms	468 KB	Output is correct
21	Correct	778 ms	476 KB	Output is correct
22	Correct	799 ms	476 KB	Output is correct
23	Execution timed out	2054 ms	52308 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-