oj.uz

답안 #860851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
860851 2023-10-14T16:00:38 Z Blagoj Election (BOI18_election) C++17
100 / 100
 444 ms 76332 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()

struct Node {
    ll sum, pref, suff, ans;
};

int n, arr[(int) 5e5 + 10];

struct SegmentTree {
    vector<Node> sgt;

    SegmentTree(int n) {
        sgt.resize(4 * n);
    }

    Node merge(Node a, Node b) {
        return { a.sum + b.sum, max(a.pref, a.sum + b.pref), max(b.suff, a.suff + b.sum), max({0LL, a.pref + b.suff, a.sum + b.ans, a.ans + b.sum}) };
    }

    void build(int k = 1, int l = 0, int r = n - 1) {
        if (l == r) {
            sgt[k] = { arr[l], max(0, arr[l]), max(0, arr[l]), max(arr[l], 0) };
            return;
        }
        int m = (l + r) / 2;
        build(k * 2, l, m);
        build(k * 2 + 1, m + 1, r);
        sgt[k] = merge(sgt[k * 2], sgt[k * 2 + 1]);
    }

    Node get(int k, int l, int r, int i, int j) {
        if (l > j || r < i) return {0, 0, 0, 0};
        if (i <= l && r <= j) return sgt[k];
        int m = (l + r) / 2;
        return merge(get(k * 2, l, m, i, j), get(k * 2 + 1, m + 1, r, i, j));
    }

} sgt(5e5);

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    string s;
    cin >> s;
    for (int i = 0; i < n; i++) arr[i] = (s[i] == 'C' ? -1 : 1);
    sgt.build();
    int q;
    cin >> q;
    while (q--) {
        int x, y;
        cin >> x >> y;
        cout << sgt.get(1, 0, n - 1, --x, --y).ans << endl;
    }
}

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 63068 KB Output is correct
2 Correct 11 ms 63068 KB Output is correct
3 Correct 10 ms 62860 KB Output is correct
4 Correct 10 ms 63064 KB Output is correct
5 Correct 10 ms 63064 KB Output is correct

Subtask #2
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 63068 KB Output is correct
2 Correct 11 ms 63068 KB Output is correct
3 Correct 10 ms 62860 KB Output is correct
4 Correct 10 ms 63064 KB Output is correct
5 Correct 10 ms 63064 KB Output is correct
6 Correct 59 ms 63688 KB Output is correct
7 Correct 49 ms 63708 KB Output is correct
8 Correct 51 ms 63712 KB Output is correct
9 Correct 46 ms 63624 KB Output is correct
10 Correct 48 ms 63580 KB Output is correct
11 Correct 50 ms 63828 KB Output is correct
12 Correct 50 ms 63828 KB Output is correct
13 Correct 47 ms 63648 KB Output is correct
14 Correct 48 ms 63828 KB Output is correct
15 Correct 48 ms 64696 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 63068 KB Output is correct
2 Correct 11 ms 63068 KB Output is correct
3 Correct 10 ms 62860 KB Output is correct
4 Correct 10 ms 63064 KB Output is correct
5 Correct 10 ms 63064 KB Output is correct
6 Correct 59 ms 63688 KB Output is correct
7 Correct 49 ms 63708 KB Output is correct
8 Correct 51 ms 63712 KB Output is correct
9 Correct 46 ms 63624 KB Output is correct
10 Correct 48 ms 63580 KB Output is correct
11 Correct 50 ms 63828 KB Output is correct
12 Correct 50 ms 63828 KB Output is correct
13 Correct 47 ms 63648 KB Output is correct
14 Correct 48 ms 63828 KB Output is correct
15 Correct 48 ms 64696 KB Output is correct
16 Correct 418 ms 75252 KB Output is correct
17 Correct 310 ms 74812 KB Output is correct
18 Correct 362 ms 75032 KB Output is correct
19 Correct 324 ms 74632 KB Output is correct
20 Correct 421 ms 74208 KB Output is correct
21 Correct 444 ms 76332 KB Output is correct
22 Correct 420 ms 75972 KB Output is correct
23 Correct 405 ms 76236 KB Output is correct
24 Correct 420 ms 75836 KB Output is correct
25 Correct 417 ms 75296 KB Output is correct