oj.uz

Submission #985173

# Submission time Handle Problem Language Result Execution time Memory
985173 2024-05-17T12:01:34 Z CrazyBotBoy Sequence (APIO23_sequence) C++17
11 / 100
 2000 ms 6640 KB 
#include "sequence.h"
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <climits>

using namespace std;

int sequence(int N, vector<int> A) {
    int maxOccurrences = 0;
    
    for (int l = 0; l < N; ++l) {
        vector<int> freq(N + 1, 0);
        vector<int> subarray; 
        
        for (int r = l; r < N; ++r) {
            subarray.push_back(A[r]);
            freq[A[r]]++;
            
            vector<int> temp = subarray;
            sort(temp.begin(), temp.end());
            int k = temp.size();
            int median1 = temp[(k - 1) / 2];
            int median2 = temp[k / 2];
            
            maxOccurrences = max(maxOccurrences, freq[median1]);
            if (median1 != median2) {
                maxOccurrences = max(maxOccurrences, freq[median2]);
            }
        }
    }

    return maxOccurrences;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 436 KB Output is correct
7 Correct 1 ms 392 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 5 ms 600 KB Output is correct

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 436 KB Output is correct
7 Correct 1 ms 392 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Execution timed out 2061 ms 496 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2057 ms 6460 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2037 ms 6640 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2033 ms 6432 KB Time limit exceeded
2 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 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 436 KB Output is correct
7 Correct 1 ms 392 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Execution timed out 2061 ms 496 KB Time limit exceeded
14 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 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 436 KB Output is correct
7 Correct 1 ms 392 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Execution timed out 2061 ms 496 KB Time limit exceeded
14 Halted 0 ms 0 KB -