답안 #982226

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982226	2024-05-14T03:55:19 Z	vjudge1	서열 (APIO23_sequence)	C++17	11 / 100	2000 ms	29752 KB

sequence

#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
priority_queue<int>pql;
priority_queue<int,vector<int>,greater<>>pqu;
multiset<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.insert(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.insert(A[j]);
            int a=pql.top();
            int b=(pql.size()==pqu.size()?pqu.top():a);
            ans=max(ans,(int)st2.count(a));
            ans=max(ans,(int)st2.count(b));
        }
    }
    return ans;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	2 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct

Subtask #2

0.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	2 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	479 ms	528 KB	Output is correct
14	Correct	476 ms	528 KB	Output is correct
15	Correct	675 ms	532 KB	Output is correct
16	Correct	634 ms	532 KB	Output is correct
17	Execution timed out	2078 ms	348 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Execution timed out	2065 ms	29604 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	2032 ms	6016 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 13.0

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

Subtask #6

0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	2 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	479 ms	528 KB	Output is correct
14	Correct	476 ms	528 KB	Output is correct
15	Correct	675 ms	532 KB	Output is correct
16	Correct	634 ms	532 KB	Output is correct
17	Execution timed out	2078 ms	348 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #7

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	2 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	479 ms	528 KB	Output is correct
14	Correct	476 ms	528 KB	Output is correct
15	Correct	675 ms	532 KB	Output is correct
16	Correct	634 ms	532 KB	Output is correct
17	Execution timed out	2078 ms	348 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-