oj.uz

Submission #580137

# Submission time Handle Problem Language Result Execution time Memory
580137 2022-06-20T16:03:38 Z jmokut Election (BOI18_election) C++17
100 / 100
 509 ms 27996 KB 
#include <iostream>
#include <vector>
#include <iomanip>
#include "algorithm"
#include <cmath>
#include <set>
#include <queue>
#include <random>
#include <chrono>
#include "unordered_set"
#include <unordered_map>
#include "map"
#include "numeric"
#include "climits"
#include "bitset"

#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define max4(p, q, r, t) max(max(p, q), max(r, t))
#define max3(p, q, r) max(max(p, q), r)
#define testcases int t; cin>>t; while(t--)
using namespace std;

struct node {
    int pref{} ;
    int suff{};
    int sum{};
    int ans{};

    node() = default;

    node(int pref, int suff, int sum, int ans) : pref(pref), suff(suff), sum(sum), ans(ans) {};
};

const int N = 5e5 + 5;
node T[N << 2];
string s;


node pull(node &u, node &v) {
    int pref = max(u.pref, u.sum + v.pref);
    int suff = max(v.suff, v.sum + u.suff);
    int sum = u.sum + v.sum;
    int ans = max(u.pref + v.suff, max(u.ans + v.sum, v.ans + u.sum));
    return {pref, suff, sum, ans};
}

void pull(int v, int tl, int tr) {
    T[v] = pull(T[v << 1], T[v << 1 | 1]);
}

void build(int v, int tl, int tr) {
    if (tl == tr) {
        int val = s[tl] == 'C' ? -1 : 1;
        T[v].ans = max(0, val);
        T[v].pref = T[v].ans;
        T[v].suff = T[v].ans;
        T[v].sum = val;
        return;
    }
    int mid = (tl + tr) >> 1;
    build(v << 1, tl, mid);
    build(v << 1 | 1, mid + 1, tr);
    pull(v, tl, tr);
}


node get_ans(int v, int tl, int tr, int l, int r) {
    if (l == tl && r == tr) {
        return T[v];
    }
    int mid = (tl + tr) >> 1;
    if (r <= mid) {
        return get_ans(v << 1, tl, mid, l, r);
    }
    if (l > mid) {
        return get_ans(v << 1 | 1, mid + 1, tr, l, r);
    }
    node left = get_ans(v << 1, tl, mid, l, mid);
    node right = get_ans(v << 1 | 1, mid + 1, tr, mid + 1, r);

    return pull(left, right);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    cin >> s;

    build(1, 0, n - 1);

    int q;
    cin >> q;

    while (q--) {

        int l, r;
        cin >> l >> r;
        --l, --r;

        node ans = get_ans(1, 0, n - 1, l, r);

        cout << ans.ans << '\n';
    }

}

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 62 ms 5788 KB Output is correct
7 Correct 41 ms 5708 KB Output is correct
8 Correct 45 ms 5712 KB Output is correct
9 Correct 39 ms 5656 KB Output is correct
10 Correct 44 ms 5668 KB Output is correct
11 Correct 44 ms 5816 KB Output is correct
12 Correct 59 ms 5952 KB Output is correct
13 Correct 62 ms 5796 KB Output is correct
14 Correct 42 ms 5804 KB Output is correct
15 Correct 43 ms 5708 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 62 ms 5788 KB Output is correct
7 Correct 41 ms 5708 KB Output is correct
8 Correct 45 ms 5712 KB Output is correct
9 Correct 39 ms 5656 KB Output is correct
10 Correct 44 ms 5668 KB Output is correct
11 Correct 44 ms 5816 KB Output is correct
12 Correct 59 ms 5952 KB Output is correct
13 Correct 62 ms 5796 KB Output is correct
14 Correct 42 ms 5804 KB Output is correct
15 Correct 43 ms 5708 KB Output is correct
16 Correct 466 ms 26972 KB Output is correct
17 Correct 422 ms 26680 KB Output is correct
18 Correct 383 ms 26828 KB Output is correct
19 Correct 367 ms 26232 KB Output is correct
20 Correct 399 ms 26012 KB Output is correct
21 Correct 448 ms 27764 KB Output is correct
22 Correct 509 ms 27704 KB Output is correct
23 Correct 455 ms 27996 KB Output is correct
24 Correct 414 ms 27648 KB Output is correct
25 Correct 491 ms 27232 KB Output is correct