oj.uz

Submission #154574

# Submission time Handle Problem Language Result Execution time Memory
154574 2019-09-22T19:04:39 Z dolphingarlic Election (BOI18_election) C++14
82 / 100
 70 ms 5884 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[400001];
char s[100001];
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 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 508 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 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 66 ms 5752 KB Output is correct
7 Correct 60 ms 5664 KB Output is correct
8 Correct 63 ms 5624 KB Output is correct
9 Correct 56 ms 5624 KB Output is correct
10 Correct 65 ms 5624 KB Output is correct
11 Correct 70 ms 5880 KB Output is correct
12 Correct 68 ms 5844 KB Output is correct
13 Correct 65 ms 5752 KB Output is correct
14 Correct 65 ms 5884 KB Output is correct
15 Correct 65 ms 5724 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 66 ms 5752 KB Output is correct
7 Correct 60 ms 5664 KB Output is correct
8 Correct 63 ms 5624 KB Output is correct
9 Correct 56 ms 5624 KB Output is correct
10 Correct 65 ms 5624 KB Output is correct
11 Correct 70 ms 5880 KB Output is correct
12 Correct 68 ms 5844 KB Output is correct
13 Correct 65 ms 5752 KB Output is correct
14 Correct 65 ms 5884 KB Output is correct
15 Correct 65 ms 5724 KB Output is correct
16 Runtime error 12 ms 2168 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -