답안 #980958

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980958	2024-05-12T16:23:29 Z	nnin	서열 (APIO23_sequence)	C++17	28 / 100	2000 ms	10248 KB

sequence

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

int ct[500005];
priority_queue<int> le;
priority_queue<int, vector<int>, greater<int>> ri;

int sequence(int N, std::vector<int> A) {
  int ret = 0;
  for(int l=0;l<N;l++) {
    while(!le.empty()) ct[le.top()]--, le.pop();
    while(!ri.empty()) ct[ri.top()]--, ri.pop();
    for(int r=l;r<N;r++) {
      if(le.empty() || A[r]<=le.top()) le.push(A[r]);
      else ri.push(A[r]);
      if(le.size()>ri.size()+1) {
        ri.push(le.top());
        le.pop();
      }
      if(ri.size()>le.size()) {
        le.push(ri.top());
        ri.pop();
      }
      ct[A[r]]++;
      ret = max(ret, ct[le.top()]);
      if(le.size()==ri.size()) ret = max(ret, ct[ri.top()]);
    }
  }
  return ret;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	444 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	0 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	444 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	0 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	199 ms	344 KB	Output is correct
14	Correct	197 ms	344 KB	Output is correct
15	Correct	200 ms	456 KB	Output is correct
16	Correct	196 ms	348 KB	Output is correct
17	Correct	141 ms	448 KB	Output is correct
18	Correct	140 ms	468 KB	Output is correct
19	Correct	195 ms	344 KB	Output is correct
20	Correct	191 ms	344 KB	Output is correct
21	Correct	195 ms	348 KB	Output is correct
22	Correct	194 ms	344 KB	Output is correct

Subtask #3

0.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Execution timed out	2005 ms	10248 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	2033 ms	7060 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2017 ms	10184 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	444 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	0 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	199 ms	344 KB	Output is correct
14	Correct	197 ms	344 KB	Output is correct
15	Correct	200 ms	456 KB	Output is correct
16	Correct	196 ms	348 KB	Output is correct
17	Correct	141 ms	448 KB	Output is correct
18	Correct	140 ms	468 KB	Output is correct
19	Correct	195 ms	344 KB	Output is correct
20	Correct	191 ms	344 KB	Output is correct
21	Correct	195 ms	348 KB	Output is correct
22	Correct	194 ms	344 KB	Output is correct
23	Execution timed out	2045 ms	2312 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #7

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	444 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	0 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	199 ms	344 KB	Output is correct
14	Correct	197 ms	344 KB	Output is correct
15	Correct	200 ms	456 KB	Output is correct
16	Correct	196 ms	348 KB	Output is correct
17	Correct	141 ms	448 KB	Output is correct
18	Correct	140 ms	468 KB	Output is correct
19	Correct	195 ms	344 KB	Output is correct
20	Correct	191 ms	344 KB	Output is correct
21	Correct	195 ms	348 KB	Output is correct
22	Correct	194 ms	344 KB	Output is correct
23	Execution timed out	2005 ms	10248 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-