Submission #983345

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
983345	2024-05-15T10:41:00 Z	vjudge1	Sequence (APIO23_sequence)	C++17	28 / 100	2000 ms	30752 KB

sequence

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace std;
using namespace __gnu_pbds;

#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> 

int sequence(int n, std::vector<int> a) {
	int ans = 0;
	for(int i = 0; i < n; i++){
		ordered_multiset st;
		for(int j = i; j < n; j++){
			st.insert(a[j]);
			int len = j - i + 1;
			int f = *st.find_by_order((len - 1) / 2);
			int s = *st.find_by_order(len / 2);
			ans = max(ans, (int)st.order_of_key(f + 1) - (int)st.order_of_key(f));
			ans = max(ans, (int)st.order_of_key(s + 1) - (int)st.order_of_key(s));
		}
	}
	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	525 ms	540 KB	Output is correct
14	Correct	529 ms	344 KB	Output is correct
15	Correct	524 ms	528 KB	Output is correct
16	Correct	551 ms	520 KB	Output is correct
17	Correct	579 ms	348 KB	Output is correct
18	Correct	632 ms	532 KB	Output is correct
19	Correct	554 ms	532 KB	Output is correct
20	Correct	567 ms	528 KB	Output is correct
21	Correct	547 ms	348 KB	Output is correct
22	Correct	563 ms	532 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	2048 ms	30752 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	2037 ms	29036 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	2025 ms	30680 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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	525 ms	540 KB	Output is correct
14	Correct	529 ms	344 KB	Output is correct
15	Correct	524 ms	528 KB	Output is correct
16	Correct	551 ms	520 KB	Output is correct
17	Correct	579 ms	348 KB	Output is correct
18	Correct	632 ms	532 KB	Output is correct
19	Correct	554 ms	532 KB	Output is correct
20	Correct	567 ms	528 KB	Output is correct
21	Correct	547 ms	348 KB	Output is correct
22	Correct	563 ms	532 KB	Output is correct
23	Execution timed out	2021 ms	5200 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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	525 ms	540 KB	Output is correct
14	Correct	529 ms	344 KB	Output is correct
15	Correct	524 ms	528 KB	Output is correct
16	Correct	551 ms	520 KB	Output is correct
17	Correct	579 ms	348 KB	Output is correct
18	Correct	632 ms	532 KB	Output is correct
19	Correct	554 ms	532 KB	Output is correct
20	Correct	567 ms	528 KB	Output is correct
21	Correct	547 ms	348 KB	Output is correct
22	Correct	563 ms	532 KB	Output is correct
23	Execution timed out	2048 ms	30752 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-