Submission #975775

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
975775	2024-05-05T20:22:01 Z	XXBabaProBerkay	Sequence (APIO23_sequence)	C++17	11 / 100	2000 ms	7944 KB

sequence

#include "sequence.h"

#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second

int sequence(int N, vector<int> A)
{
	int ans = 0;
	for (int i = 0; i < N; i++)
		for (int j = i; j < N; j++)
		{
			vector<int> v;
			for (int k = i; k <= j; k++)
				v.push_back(A[k]);

			sort(v.begin(), v.end());

			int x = 0, y = 0;
			for (int k : v)
				if (k == v[(j - i) / 2])
					x++;
				else if (k == v[(j - i + 1) / 2])
					y++;

			if (v[(j - i) / 2] == v[(j - i + 1) / 2])
				x += y;

			ans = max(ans, max(x, y));
		}

	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	1 ms	432 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	4 ms	348 KB	Output is correct
6	Correct	4 ms	436 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	4 ms	440 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Correct	4 ms	348 KB	Output is correct
12	Correct	4 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	1 ms	432 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	4 ms	348 KB	Output is correct
6	Correct	4 ms	436 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	4 ms	440 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Correct	4 ms	348 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Execution timed out	2033 ms	344 KB	Time limit exceeded
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	2019 ms	7852 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	432 KB	Output is correct
2	Execution timed out	2095 ms	5644 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	2033 ms	7944 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	1 ms	432 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	4 ms	348 KB	Output is correct
6	Correct	4 ms	436 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	4 ms	440 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Correct	4 ms	348 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Execution timed out	2033 ms	344 KB	Time limit exceeded
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	1 ms	432 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	4 ms	348 KB	Output is correct
6	Correct	4 ms	436 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	4 ms	440 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Correct	4 ms	348 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Execution timed out	2033 ms	344 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-