oj.uz

Submission #974311

# Submission time Handle Problem Language Result Execution time Memory
974311 2024-05-03T08:15:38 Z Pannda Sequence (APIO23_sequence) C++17
40 / 100
 2000 ms 51536 KB 
#include "sequence.h"

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

int sequence(int n, vector<int> a) {
    vector<vector<int>> mp(n);
    for (int i = 0; i < n; i++) {
        a[i]--;
        mp[a[i]].push_back(i);
    }

    auto ok = [&](int x) -> bool {
        for (int med = 0; med < n; med++) {
            if (mp[med].empty()) continue;

            vector<int> cnt(n + 1, 0);
            vector<int> le_lr(n + 1, 0), mx_le_lr(n + 1, 0);
            vector<int> le_rl(n + 1, 0), mx_le_rl(n + 1, 0);
            vector<int> ge_lr(n + 1, 0), mx_ge_lr(n + 1, 0);
            vector<int> ge_rl(n + 1, 0), mx_ge_rl(n + 1, 0);
            for (int i = 0; i < n; i++) {
                cnt[i + 1] = cnt[i] + (a[i] <= med);
                le_lr[i + 1] = le_lr[i] + 2 * (a[i] <= med) - 1;
                ge_lr[i + 1] = ge_lr[i] + 2 * (a[i] >= med) - 1;
            }
            for (int i = n - 1; i >= 0; i--) {
                le_rl[i] = le_rl[i + 1] + 2 * (a[i] <= med) - 1;
                ge_rl[i] = ge_rl[i + 1] + 2 * (a[i] >= med) - 1;
            }
            mx_le_lr[n] = le_lr[n], mx_ge_lr[n] = ge_lr[n];
            for (int i = n - 1; i >= 0; i--) {
                mx_le_lr[i] = max(le_lr[i], mx_le_lr[i + 1]);
                mx_ge_lr[i] = max(ge_lr[i], mx_ge_lr[i + 1]);
            }
            mx_le_rl[0] = le_rl[0], mx_ge_rl[0] = ge_rl[0];
            for (int i = 1; i <= n; i++) {
                mx_le_rl[i] = max(le_rl[i], mx_le_rl[i - 1]);
                mx_ge_rl[i] = max(ge_rl[i], mx_ge_rl[i - 1]);
            }

            for (int ii = 0; ii + x <= mp[med].size(); ii++) {
                int l = mp[med][ii];
                int r = mp[med][ii + x - 1] + 1;
                int lem = cnt[r] - cnt[l];
                int gem = (r - l) - lem + x;
                if (2 * lem >= r - l && 2 * gem >= r - l) return true;
                if (2 * lem < r - l) {
                    int val = 2 * lem - r + l; // < 0
                    int up = mx_le_lr[r] - le_lr[r] + mx_le_rl[l] - le_rl[l];
                    if (val + up >= 0) return true;
                } else {
                    int val = 2 * gem - r + l; // < 0
                    int up = mx_ge_lr[r] - ge_lr[r] + mx_ge_rl[l] - ge_rl[l];
                    if (val + up >= 0) return true;
                }
            }
        }
        return false;
    };

    int ans = [&]() -> int {
        int l = 1, r = n;
        while (l < r) {
            int m = (l + r + 1) >> 1;
            if (ok(m)) {
                l = m;
            } else {
                r = m - 1;
            }
        }
        return l;
    }();

    return ans;
}

Compilation message

sequence.cpp: In lambda function:
sequence.cpp:42:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |             for (int ii = 0; ii + x <= mp[med].size(); ii++) {
      |                              ~~~~~~~^~~~~~~~~~~~~~~~~

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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 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 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
17.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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 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 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 346 ms 604 KB Output is correct
14 Correct 311 ms 756 KB Output is correct
15 Correct 12 ms 596 KB Output is correct
16 Correct 12 ms 600 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 486 ms 612 KB Output is correct
19 Correct 279 ms 600 KB Output is correct
20 Correct 250 ms 600 KB Output is correct
21 Correct 268 ms 600 KB Output is correct
22 Correct 276 ms 584 KB Output is correct

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 2103 ms 46048 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 572 ms 36772 KB Output is correct
3 Correct 705 ms 36688 KB Output is correct
4 Correct 724 ms 36848 KB Output is correct
5 Correct 852 ms 37520 KB Output is correct
6 Correct 304 ms 36800 KB Output is correct

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2098 ms 51536 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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 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 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 346 ms 604 KB Output is correct
14 Correct 311 ms 756 KB Output is correct
15 Correct 12 ms 596 KB Output is correct
16 Correct 12 ms 600 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 486 ms 612 KB Output is correct
19 Correct 279 ms 600 KB Output is correct
20 Correct 250 ms 600 KB Output is correct
21 Correct 268 ms 600 KB Output is correct
22 Correct 276 ms 584 KB Output is correct
23 Execution timed out 2025 ms 8224 KB Time limit exceeded
24 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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 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 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 346 ms 604 KB Output is correct
14 Correct 311 ms 756 KB Output is correct
15 Correct 12 ms 596 KB Output is correct
16 Correct 12 ms 600 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 486 ms 612 KB Output is correct
19 Correct 279 ms 600 KB Output is correct
20 Correct 250 ms 600 KB Output is correct
21 Correct 268 ms 600 KB Output is correct
22 Correct 276 ms 584 KB Output is correct
23 Execution timed out 2103 ms 46048 KB Time limit exceeded
24 Halted 0 ms 0 KB -