답안 #977740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977740	2024-05-08T10:19:42 Z	Unforgettablepl	서열 (APIO23_sequence)	C++17	28 / 100	2000 ms	68500 KB

sequence

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

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
#define ordered_set tree<pair<int,int>, null_type,less<>, rb_tree_tag,tree_order_statistics_node_update>

#define int long long

int32_t sequence(int32_t N, std::vector<int32_t> A) {
    int32_t ans = 0;
    for(int i=0;i<N;i++){
        int k = 0;
        map<int,int32_t> freq;
        ordered_set window;
        for(int j=i;j<N;j++){
            k++;freq[A[j]]++;window.insert({A[j],j});
            ans=max(freq[(*window.find_by_order(k/2)).first],ans);
            if(k%2==0) {
                ans=max(freq[(*window.find_by_order((k/2)-1)).first],ans);
            }
        }
    }
    return ans;
}

//int32_t main() {
//    int32_t N;
//    assert(1 == scanf("%d", &N));
//
//    std::vector<int32_t> A(N);
//    for (int32_t i = 0; i < N; ++i) {
//        assert(1 == scanf("%d", &A[i]));
//    }
//
//    int32_t result = sequence(N, A);
//    printf("%d\n", result);
//    return 0;
//}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	436 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	436 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	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	436 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	436 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	436 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	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	436 KB	Output is correct
13	Correct	633 ms	636 KB	Output is correct
14	Correct	619 ms	640 KB	Output is correct
15	Correct	437 ms	560 KB	Output is correct
16	Correct	434 ms	344 KB	Output is correct
17	Correct	379 ms	344 KB	Output is correct
18	Correct	500 ms	604 KB	Output is correct
19	Correct	608 ms	628 KB	Output is correct
20	Correct	581 ms	848 KB	Output is correct
21	Correct	597 ms	628 KB	Output is correct
22	Correct	608 ms	620 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	2025 ms	57348 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 12.0

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

Subtask #5

0.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2099 ms	68500 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	436 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	436 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	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	436 KB	Output is correct
13	Correct	633 ms	636 KB	Output is correct
14	Correct	619 ms	640 KB	Output is correct
15	Correct	437 ms	560 KB	Output is correct
16	Correct	434 ms	344 KB	Output is correct
17	Correct	379 ms	344 KB	Output is correct
18	Correct	500 ms	604 KB	Output is correct
19	Correct	608 ms	628 KB	Output is correct
20	Correct	581 ms	848 KB	Output is correct
21	Correct	597 ms	628 KB	Output is correct
22	Correct	608 ms	620 KB	Output is correct
23	Execution timed out	2029 ms	9552 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	436 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	436 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	2 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	436 KB	Output is correct
13	Correct	633 ms	636 KB	Output is correct
14	Correct	619 ms	640 KB	Output is correct
15	Correct	437 ms	560 KB	Output is correct
16	Correct	434 ms	344 KB	Output is correct
17	Correct	379 ms	344 KB	Output is correct
18	Correct	500 ms	604 KB	Output is correct
19	Correct	608 ms	628 KB	Output is correct
20	Correct	581 ms	848 KB	Output is correct
21	Correct	597 ms	628 KB	Output is correct
22	Correct	608 ms	620 KB	Output is correct
23	Execution timed out	2025 ms	57348 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-