oj.uz

Submission #313415

# Submission time Handle Problem Language Result Execution time Memory
313415 2020-10-16T00:13:56 Z Benq Election (BOI18_election) C++11
100 / 100
 646 ms 28020 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 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 69 ms 5752 KB Output is correct
7 Correct 61 ms 5624 KB Output is correct
8 Correct 64 ms 5752 KB Output is correct
9 Correct 55 ms 5624 KB Output is correct
10 Correct 69 ms 5756 KB Output is correct
11 Correct 64 ms 5752 KB Output is correct
12 Correct 67 ms 5880 KB Output is correct
13 Correct 66 ms 5880 KB Output is correct
14 Correct 63 ms 5752 KB Output is correct
15 Correct 66 ms 5752 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 69 ms 5752 KB Output is correct
7 Correct 61 ms 5624 KB Output is correct
8 Correct 64 ms 5752 KB Output is correct
9 Correct 55 ms 5624 KB Output is correct
10 Correct 69 ms 5756 KB Output is correct
11 Correct 64 ms 5752 KB Output is correct
12 Correct 67 ms 5880 KB Output is correct
13 Correct 66 ms 5880 KB Output is correct
14 Correct 63 ms 5752 KB Output is correct
15 Correct 66 ms 5752 KB Output is correct
16 Correct 646 ms 26872 KB Output is correct
17 Correct 552 ms 26684 KB Output is correct
18 Correct 578 ms 26744 KB Output is correct
19 Correct 483 ms 26232 KB Output is correct
20 Correct 631 ms 26104 KB Output is correct
21 Correct 635 ms 27772 KB Output is correct
22 Correct 630 ms 27732 KB Output is correct
23 Correct 644 ms 28020 KB Output is correct
24 Correct 628 ms 27676 KB Output is correct
25 Correct 646 ms 27256 KB Output is correct