oj.uz

답안 #564367

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564367 2022-05-19T04:29:14 Z KoD Hacker (BOI15_hac) C++17
100 / 100
 52 ms 11744 KB 
#include <bits/stdc++.h>

using std::deque;
using std::pair;
using std::vector;

class SlidingMinimum {
    int push_i, pop_i;
    deque<pair<int, int>> deq;

  public:
    SlidingMinimum() : push_i(0), pop_i(0), deq() {}

    void push(const int x) {
        while (!deq.empty() and deq.back().first >= x) {
            deq.pop_back();
        }
        deq.emplace_back(x, push_i++);
    }

    void pop() {
        if (deq.front().second == pop_i) {
            deq.pop_front();
        }
        pop_i += 1;
    }

    int min() const { return deq.front().first; }
};

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    std::cin >> N;
    vector<int> V(N);
    for (auto& x : V) {
        std::cin >> x;
    }
    vector<int> sum(2 * N + 1);
    for (int i = 0; i < N; ++i) {
        sum[i + 1] = sum[i] + V[i];
    }
    for (int i = 0; i < N; ++i) {
        sum[i + N + 1] = sum[i + N] + V[i];
    }
    const int len = (N + 1) / 2;
    vector<int> take(N);
    for (int i = 0; i < N; ++i) {
        take[i] = sum[i + len] - sum[i];
    }
    SlidingMinimum window;
    for (int i = N - len; i < N; ++i) {
        window.push(take[i]);
    }
    int ans = 0;
    for (int i = 0; i < N; ++i) {
        window.pop();
        window.push(take[i]);
        ans = std::max(ans, window.min());
    }
    std::cout << ans << '\n';
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 328 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 9 ms 1876 KB Output is correct
5 Correct 20 ms 4180 KB Output is correct
6 Correct 28 ms 5264 KB Output is correct
7 Correct 31 ms 6324 KB Output is correct
8 Correct 51 ms 10208 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 328 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 9 ms 1876 KB Output is correct
36 Correct 20 ms 4180 KB Output is correct
37 Correct 28 ms 5264 KB Output is correct
38 Correct 31 ms 6324 KB Output is correct
39 Correct 51 ms 10208 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 3 ms 596 KB Output is correct
42 Correct 4 ms 852 KB Output is correct
43 Correct 23 ms 4300 KB Output is correct
44 Correct 52 ms 10336 KB Output is correct
45 Correct 13 ms 2252 KB Output is correct
46 Correct 32 ms 6224 KB Output is correct
47 Correct 51 ms 10212 KB Output is correct
48 Correct 44 ms 10572 KB Output is correct
49 Correct 41 ms 11740 KB Output is correct
50 Correct 40 ms 11744 KB Output is correct