Submission #976261

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
976261	2024-05-06T11:12:49 Z	josanneo22	Sequence (APIO23_sequence)	C++17	28 / 100	2000 ms	31808 KB

sequence

#include "sequence.h"
#include <vector>

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

int sequence(int N, std::vector<int> a) {
  int ans = 0;
  for (int i = 0; i < N; i++) {
    priority_queue<int> front;
    priority_queue<int, vector<int>, greater<int>> back;
    map<int, int> cnt;
    for (int j = i; j < N; j++) {
      front.push(a[j]);
      cnt[a[j]]++;
      while (front.size() - back.size() >= 2) {
        back.push(front.top());
        front.pop();
      }
      while (back.size() && front.top() > back.top()) {
        int A = front.top(); front.pop();
        int B = back.top(); back.pop();
        back.push(A); front.push(B);
      }
      if (front.size() == back.size()) {
        int m1 = front.top();
        int m2 = back.top();
        ans = max(ans, cnt[m1]);
        ans = max(ans, cnt[m2]);
      }
      else {
        int m1 = front.top();
        ans = max(ans, cnt[m1]);
      }
    }
  }
  return ans;
}

// #include "grader.cpp"

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	432 KB	Output is correct
4	Correct	2 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	1 ms	348 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	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	432 KB	Output is correct
4	Correct	2 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	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	439 ms	348 KB	Output is correct
14	Correct	421 ms	600 KB	Output is correct
15	Correct	234 ms	348 KB	Output is correct
16	Correct	233 ms	596 KB	Output is correct
17	Correct	150 ms	448 KB	Output is correct
18	Correct	401 ms	544 KB	Output is correct
19	Correct	413 ms	344 KB	Output is correct
20	Correct	353 ms	348 KB	Output is correct
21	Correct	413 ms	348 KB	Output is correct
22	Correct	391 ms	516 KB	Output is correct

Subtask #3

0.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Execution timed out	2067 ms	23172 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	2039 ms	8548 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	2008 ms	31808 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	432 KB	Output is correct
4	Correct	2 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	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	439 ms	348 KB	Output is correct
14	Correct	421 ms	600 KB	Output is correct
15	Correct	234 ms	348 KB	Output is correct
16	Correct	233 ms	596 KB	Output is correct
17	Correct	150 ms	448 KB	Output is correct
18	Correct	401 ms	544 KB	Output is correct
19	Correct	413 ms	344 KB	Output is correct
20	Correct	353 ms	348 KB	Output is correct
21	Correct	413 ms	348 KB	Output is correct
22	Correct	391 ms	516 KB	Output is correct
23	Execution timed out	2041 ms	4504 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	432 KB	Output is correct
4	Correct	2 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	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	439 ms	348 KB	Output is correct
14	Correct	421 ms	600 KB	Output is correct
15	Correct	234 ms	348 KB	Output is correct
16	Correct	233 ms	596 KB	Output is correct
17	Correct	150 ms	448 KB	Output is correct
18	Correct	401 ms	544 KB	Output is correct
19	Correct	413 ms	344 KB	Output is correct
20	Correct	353 ms	348 KB	Output is correct
21	Correct	413 ms	348 KB	Output is correct
22	Correct	391 ms	516 KB	Output is correct
23	Execution timed out	2067 ms	23172 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-