oj.uz

Submission #154575

# Submission time Handle Problem Language Result Execution time Memory
154575 2019-09-22T19:05:10 Z dolphingarlic Election (BOI18_election) C++14
100 / 100
 654 ms 27896 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

struct Node {
    int l_min, r_min, tot, ans;

    Node operator+(Node b) {
        Node ret;
        ret.l_min = max(l_min, b.l_min - tot);
        ret.r_min = max(r_min - b.tot, b.r_min);
        ret.tot = tot + b.tot;
        ret.ans = max(max(ans - b.tot, b.ans - tot), l_min + b.r_min);
        return ret;
    }
};

Node segtree[2000001];
char s[500001];
int n;

void build(int node = 1, int l = 1, int r = n) {
    if (l == r) {
        if (s[l] == 'T') segtree[node] = {1, 1, -1, 1};
        else segtree[node] = {0, 0, 1, 0};
    } else {
        int mid = (l + r) / 2;
        build(node * 2, l, mid);
        build(node * 2 + 1, mid + 1, r);
        segtree[node] = segtree[node * 2] + segtree[node * 2 + 1];
    }
}

Node query(int a, int b, int node = 1, int l = 1, int r = n) {
    if (l > b || r < a) return {0, 0, 0, 0};
    if (l >= a && r <= b) return segtree[node];
    int mid = (l + r) / 2;
    return query(a, b, node * 2, l, mid) + query(a, b, node * 2 + 1, mid + 1, r);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    FOR(i, 1, n + 1) cin >> s[i];
    build();
    int q;
    cin >> q;
    while (q--) {
        int a, b;
        cin >> a >> b;
        cout << query(a, b).ans << '\n';
    }
    return 0;
}

Subtask #1
28.0 / 28.0

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

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 372 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 65 ms 4764 KB Output is correct
7 Correct 60 ms 4860 KB Output is correct
8 Correct 64 ms 4728 KB Output is correct
9 Correct 56 ms 4728 KB Output is correct
10 Correct 66 ms 4724 KB Output is correct
11 Correct 62 ms 4856 KB Output is correct
12 Correct 63 ms 4808 KB Output is correct
13 Correct 61 ms 4856 KB Output is correct
14 Correct 66 ms 4844 KB Output is correct
15 Correct 65 ms 4856 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 372 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 65 ms 4764 KB Output is correct
7 Correct 60 ms 4860 KB Output is correct
8 Correct 64 ms 4728 KB Output is correct
9 Correct 56 ms 4728 KB Output is correct
10 Correct 66 ms 4724 KB Output is correct
11 Correct 62 ms 4856 KB Output is correct
12 Correct 63 ms 4808 KB Output is correct
13 Correct 61 ms 4856 KB Output is correct
14 Correct 66 ms 4844 KB Output is correct
15 Correct 65 ms 4856 KB Output is correct
16 Correct 600 ms 26352 KB Output is correct
17 Correct 532 ms 26452 KB Output is correct
18 Correct 565 ms 26784 KB Output is correct
19 Correct 490 ms 26208 KB Output is correct
20 Correct 605 ms 26100 KB Output is correct
21 Correct 620 ms 27848 KB Output is correct
22 Correct 604 ms 27628 KB Output is correct
23 Correct 610 ms 27896 KB Output is correct
24 Correct 631 ms 27728 KB Output is correct
25 Correct 654 ms 27316 KB Output is correct