oj.uz

Submission #752892

# Submission time Handle Problem Language Result Execution time Memory
752892 2023-06-04T08:07:08 Z I_love_Hoang_Yen Sequence (APIO23_sequence) C++17
11 / 100
 50 ms 4184 KB 
#include "sequence.h"
#include <bits/stdc++.h>
#define SZ(s) ((int) ((s).size()))
using namespace std;

vector<int> medians(const vector<int> values) {
    int n = SZ(values);
    assert(n > 0);
    if (n % 2 == 0) {
        return {values[n/2 - 1], values[n / 2]};
    } else {
        return {values[n/2]};
    }
}

int sub1(const vector<int>& a) {
    int n = SZ(a);
    int res = 0;
    for (int l = 0; l < n; ++l) {
        for (int r = l; r < n; ++r) {
            vector<int> b(a.begin() + l, a.begin() + r + 1);

            unordered_map<int, int> cnt;
            for (int val : b) cnt[val] += 1;

            sort(b.begin(), b.end());
            auto meds = medians(b);
            for (int med : meds) {
                res = max(res, cnt[med]);
            }
        }
    }
    return res;
}

int sequence(int n, std::vector<int> a) {
    if (n <= 100) return sub1(a);
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 15 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 9 ms 212 KB Output is correct
9 Correct 11 ms 308 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 13 ms 304 KB Output is correct
12 Correct 12 ms 308 KB Output is correct

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 15 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 9 ms 212 KB Output is correct
9 Correct 11 ms 308 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 13 ms 304 KB Output is correct
12 Correct 12 ms 308 KB Output is correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

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

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 13.0

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

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 15 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 9 ms 212 KB Output is correct
9 Correct 11 ms 308 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 13 ms 304 KB Output is correct
12 Correct 12 ms 308 KB Output is correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 15 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 9 ms 212 KB Output is correct
9 Correct 11 ms 308 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 13 ms 304 KB Output is correct
12 Correct 12 ms 308 KB Output is correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -