oj.uz

Submission #236957

# Submission time Handle Problem Language Result Execution time Memory
236957 2020-06-04T06:09:09 Z PeppaPig Election (BOI18_election) C++14
100 / 100
 1002 ms 43844 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 1 << 19;

class SegmentTree {
private:
    int t[N << 1], lz[N << 1];

    void push(int p, int l, int r) {
        if(lz[p]) {
            t[p] += lz[p];
            if(l != r) lz[p << 1] += lz[p], lz[p << 1 | 1] += lz[p];
            lz[p] = 0;
        }
    }
    template<typename T>
    void travel(int x, int y, const T &f, int p = 1, int l = 0, int r = N - 1) {
        push(p, l, r);
        if(x > r || l > y) return;
        if(x <= l && r <= y) return f(p, l, r);
        int mid = (l + r) >> 1;
        travel(x, y, f, p << 1, l, mid), travel(x, y, f, p << 1 | 1, mid + 1, r);
        t[p] = min(t[p << 1], t[p << 1 | 1]);
    }
public:
    void update(int x, int y, int k) {
        travel(x, y, [&](int p, int l, int r) { lz[p] += k, push(p, l, r); });
    }
    int query(int x, int y, int ret = 1e9) {
        travel(x, y, [&](int p, int l, int r) { ret = min(ret, t[p]); });
        return ret;
    }
} tree;

int n, q, ans[N];
char S[N];
vector<pii> Q[N];

int main() {
    scanf("%d %s %d", &n, S + 1, &q);
    for(int i = 1, a, b; i <= q; i++) {
        scanf("%d %d", &a, &b);
        Q[b].emplace_back(a, i);
    }
    vector<int> stk;
    for(int i = 1; i <= n; i++) {
        if(S[i] == 'C') {
            if(!stk.empty()) tree.update(stk.back(), n, -1), stk.pop_back();
            tree.update(i, n, 1);
        } else stk.emplace_back(i);
        for(pii p : Q[i]) {
            int lhs = min(0, tree.query(p.x, i) - tree.query(p.x - 1, p.x - 1));
            int rhs = (int)stk.size() - (lower_bound(stk.begin(), stk.end(), p.x) - stk.begin());
            ans[p.y] = rhs - lhs;
        }
    }
    for(int i = 1; i <= q; i++) printf("%d\n", ans[i]);

    return 0;
}

Compilation message

election.cpp: In function 'int main()':
election.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %s %d", &n, S + 1, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
election.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12800 KB Output is correct
2 Correct 15 ms 12928 KB Output is correct
3 Correct 16 ms 12800 KB Output is correct
4 Correct 15 ms 12928 KB Output is correct
5 Correct 14 ms 12928 KB Output is correct

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12800 KB Output is correct
2 Correct 15 ms 12928 KB Output is correct
3 Correct 16 ms 12800 KB Output is correct
4 Correct 15 ms 12928 KB Output is correct
5 Correct 14 ms 12928 KB Output is correct
6 Correct 132 ms 16760 KB Output is correct
7 Correct 128 ms 16352 KB Output is correct
8 Correct 112 ms 16504 KB Output is correct
9 Correct 115 ms 16760 KB Output is correct
10 Correct 138 ms 16632 KB Output is correct
11 Correct 140 ms 16888 KB Output is correct
12 Correct 124 ms 16888 KB Output is correct
13 Correct 138 ms 17016 KB Output is correct
14 Correct 123 ms 16888 KB Output is correct
15 Correct 126 ms 16760 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12800 KB Output is correct
2 Correct 15 ms 12928 KB Output is correct
3 Correct 16 ms 12800 KB Output is correct
4 Correct 15 ms 12928 KB Output is correct
5 Correct 14 ms 12928 KB Output is correct
6 Correct 132 ms 16760 KB Output is correct
7 Correct 128 ms 16352 KB Output is correct
8 Correct 112 ms 16504 KB Output is correct
9 Correct 115 ms 16760 KB Output is correct
10 Correct 138 ms 16632 KB Output is correct
11 Correct 140 ms 16888 KB Output is correct
12 Correct 124 ms 16888 KB Output is correct
13 Correct 138 ms 17016 KB Output is correct
14 Correct 123 ms 16888 KB Output is correct
15 Correct 126 ms 16760 KB Output is correct
16 Correct 998 ms 42236 KB Output is correct
17 Correct 822 ms 39244 KB Output is correct
18 Correct 896 ms 40292 KB Output is correct
19 Correct 872 ms 41904 KB Output is correct
20 Correct 963 ms 41208 KB Output is correct
21 Correct 1002 ms 43636 KB Output is correct
22 Correct 988 ms 42964 KB Output is correct
23 Correct 985 ms 43844 KB Output is correct
24 Correct 985 ms 43324 KB Output is correct
25 Correct 971 ms 42312 KB Output is correct