oj.uz

Submission #977754

# Submission time Handle Problem Language Result Execution time Memory
977754 2024-05-08T10:35:35 Z Unforgettablepl Sequence (APIO23_sequence) C++17
7 / 100
 299 ms 38736 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

int32_t sequence(int32_t N, std::vector<int32_t> A) {
    int32_t ans = 0;
    map<int,int32_t > freq;
    int32_t curr = 1;freq[A[0]]++;
    for(int i=1;i<N;i++){
        freq[A[i]]++;
        if(A[i]==A[i-1]){
            curr++;
        } else {
            ans = max(ans,curr);
            curr = 1;
        }
    }
    ans = max(ans,curr);
    int k = N/2;
    if(N%2==0)k--;
    int currless = 0;
    for(auto[val,fre]:freq){
        currless+=fre;
        if(k<currless)ans = max(ans,fre);
    }
    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
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 117 ms 24108 KB Output is correct
3 Correct 111 ms 27192 KB Output is correct
4 Correct 31 ms 5212 KB Output is correct
5 Correct 103 ms 25168 KB Output is correct
6 Correct 98 ms 25168 KB Output is correct
7 Correct 34 ms 5712 KB Output is correct
8 Correct 34 ms 5712 KB Output is correct
9 Correct 31 ms 5212 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 35652 KB Output is correct
2 Correct 255 ms 38736 KB Output is correct
3 Incorrect 299 ms 37772 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -