답안 #982263

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982263	2024-05-14T05:02:29 Z	vjudge1	서열 (APIO23_sequence)	C++17	28 / 100	2000 ms	29692 KB

sequence

#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
priority_queue<int>pql;
priority_queue<int,vector<int>,greater<>>pqu;
map<int,int>st2;
void balance(){
    if(pql.size()<pqu.size())
        pql.push(pqu.top()),pqu.pop();
    if(pql.size()-pqu.size()>1)
        pqu.push(pql.top()),pql.pop();
}
int sequence(int N, std::vector<int> A) {
    int ans=1;
    for(int i=0;i<N;i++){
        st2.clear();
        while(pql.size())
            pql.pop();
        while(pqu.size())
            pqu.pop();
        pql.push(A[i]);
        st2[A[i]]++;
        for(int j=i+1;j<N;j++) {
            if(A[j]<=pql.top())
                pql.push(A[j]);
            else pqu.push(A[j]);
            balance();
            st2[A[j]]++;
            int a=pql.top();
            int b=(pql.size()==pqu.size()?pqu.top():a);
            ans=max(ans,st2[a]);
            ans=max(ans,st2[b]);
        }
    }
    return ans;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	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	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	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	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	473 ms	496 KB	Output is correct
14	Correct	474 ms	496 KB	Output is correct
15	Correct	310 ms	440 KB	Output is correct
16	Correct	307 ms	440 KB	Output is correct
17	Correct	175 ms	440 KB	Output is correct
18	Correct	404 ms	592 KB	Output is correct
19	Correct	451 ms	496 KB	Output is correct
20	Correct	429 ms	496 KB	Output is correct
21	Correct	447 ms	492 KB	Output is correct
22	Correct	459 ms	496 KB	Output is correct

Subtask #3

0.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	2063 ms	20960 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	2040 ms	6416 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 13.0

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

Subtask #6

0.0 / 22.0

#	결과	실행 시간	메모리	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	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	473 ms	496 KB	Output is correct
14	Correct	474 ms	496 KB	Output is correct
15	Correct	310 ms	440 KB	Output is correct
16	Correct	307 ms	440 KB	Output is correct
17	Correct	175 ms	440 KB	Output is correct
18	Correct	404 ms	592 KB	Output is correct
19	Correct	451 ms	496 KB	Output is correct
20	Correct	429 ms	496 KB	Output is correct
21	Correct	447 ms	492 KB	Output is correct
22	Correct	459 ms	496 KB	Output is correct
23	Execution timed out	2039 ms	4168 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #7

0.0 / 18.0

#	결과	실행 시간	메모리	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	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	473 ms	496 KB	Output is correct
14	Correct	474 ms	496 KB	Output is correct
15	Correct	310 ms	440 KB	Output is correct
16	Correct	307 ms	440 KB	Output is correct
17	Correct	175 ms	440 KB	Output is correct
18	Correct	404 ms	592 KB	Output is correct
19	Correct	451 ms	496 KB	Output is correct
20	Correct	429 ms	496 KB	Output is correct
21	Correct	447 ms	492 KB	Output is correct
22	Correct	459 ms	496 KB	Output is correct
23	Execution timed out	2063 ms	20960 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-