Submission #880253

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
880253	2023-11-29T04:45:28 Z	yusuf12360	Sequence (APIO23_sequence)	C++17	11 / 100	2000 ms	52728 KB

sequence

#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
int sequence(int n, vector<int> a) {
	vector<vector<int>> pos(n+1);
	for(int i=0; i<n; i++) pos[a[i]].push_back(i);
	int ans=0;
	for(int i=1; i<=n; i++) {
		for(int p : pos[i]) {
			int temp=0, els=0, add=0;
			set<int> s; s.insert(0);
			for(int l=p-1; l>=0; l--) {
				if(a[l]==i) break;
				else if(a[l]<i) add--;
				else add++;
				s.insert(add);
			}
			for(int r=p; r<n; r++) {
				if(a[r]==i) {
					temp++;
					if(abs(els)<=temp) ans=max(ans, temp);
					else {
						auto it=s.lower_bound(-temp-els);
						if(it!=s.end() && abs(els+*it)<=temp) ans=max(ans, temp);
					}
				} else if(a[r]<i) els--;
				else els++;
			}
		}
	}
	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	0 ms	436 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	436 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct

Subtask #2

0.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	0 ms	436 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	436 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Incorrect	61 ms	676 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

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	2013 ms	52728 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	2075 ms	19968 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	2086 ms	48976 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	0 ms	436 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	436 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Incorrect	61 ms	676 KB	Output isn't correct
14	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	0 ms	436 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	436 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Incorrect	61 ms	676 KB	Output isn't correct
14	Halted	0 ms	0 KB	-