oj.uz

Submission #328930

# Submission time Handle Problem Language Result Execution time Memory
328930 2020-11-18T13:34:46 Z dolphingarlic Examination (JOI19_examination) C++14
100 / 100
 1792 ms 17192 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

const int N = 100000, BCKT = 750;

int n, q;
int s[N], t[N], sums[N], sum_ptr[N];
pair<int, int> by_s[N], by_t[N];
vector<tuple<int, int, int, int>> queries[N / BCKT + 1];
int bit[N + 1];
int ans[N];

void update(int pos, int val) {
    for (; pos <= n; pos += pos & -pos) bit[pos] += val;
}

int query(int l, int r) {
    int ans = 0;
    for (; r; r -= r & -r) ans += bit[r];
    for (l--; l; l -= l & -l) ans -= bit[l];
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    for (int i = 0; i < n; i++) {
        cin >> s[i] >> t[i];
        sums[i] = s[i] + t[i];
        by_s[i] = {s[i], i};
        by_t[i] = {t[i], i};
    }
    sort(sums, sums + n);
    for (int i = 0; i < n; i++) {
        sum_ptr[i] = lower_bound(sums, sums + n, s[i] + t[i]) - sums + 1;
    }
    sort(by_s, by_s + n);
    sort(by_t, by_t + n);
    for (int i = 0; i < q; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a = lower_bound(by_s, by_s + n, make_pair(a, 0)) - by_s;
        b = lower_bound(by_t, by_t + n, make_pair(b, 0)) - by_t;
        c = lower_bound(sums, sums + n, c) - sums + 1;
        queries[a / BCKT].push_back(tuple<int, int, int, int>(a, b, c, i));
    }

    gp_hash_table<int, int> good_cnt;
    for (int i = N / BCKT, sptr = n, tptr = n; ~i; i--) {
        sort(queries[i].begin(), queries[i].end(), [](tuple<int, int, int, int> A, tuple<int, int, int, int> B) {
            return get<1>(A) > get<1>(B);
        });
        for (tuple<int, int, int, int> j : queries[i]) {
            int a, b, c, idx;
            tie(a, b, c, idx) = j;

            while (sptr > a) {
                good_cnt[by_s[sptr - 1].second]++;
                if (good_cnt[by_s[sptr - 1].second] == 2) {
                    update(sum_ptr[by_s[sptr - 1].second], 1);
                }
                sptr--;
            }
            while (sptr < a) {
                good_cnt[by_s[sptr].second]--;
                if (good_cnt[by_s[sptr].second] == 1) {
                    update(sum_ptr[by_s[sptr].second], -1);
                }
                sptr++;
            }
            while (tptr > b) {
                good_cnt[by_t[tptr - 1].second]++;
                if (good_cnt[by_t[tptr - 1].second] == 2) {
                    update(sum_ptr[by_t[tptr - 1].second], 1);
                }
                tptr--;
            }
            while (tptr < b) {
                good_cnt[by_t[tptr].second]--;
                if (good_cnt[by_t[tptr].second] == 1) {
                    update(sum_ptr[by_t[tptr].second], -1);
                }
                tptr++;
            }
            ans[idx] = query(c, n);
        }
    }

    for (int i = 0; i < q; i++) cout << ans[i] << '\n';
    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 20 ms 748 KB Output is correct
8 Correct 19 ms 748 KB Output is correct
9 Correct 20 ms 748 KB Output is correct
10 Correct 19 ms 748 KB Output is correct
11 Correct 16 ms 748 KB Output is correct
12 Correct 16 ms 748 KB Output is correct
13 Correct 19 ms 748 KB Output is correct
14 Correct 19 ms 748 KB Output is correct
15 Correct 19 ms 876 KB Output is correct
16 Correct 4 ms 748 KB Output is correct
17 Correct 16 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1693 ms 11956 KB Output is correct
2 Correct 1764 ms 14604 KB Output is correct
3 Correct 1732 ms 14460 KB Output is correct
4 Correct 1320 ms 13976 KB Output is correct
5 Correct 209 ms 13052 KB Output is correct
6 Correct 154 ms 12196 KB Output is correct
7 Correct 938 ms 13848 KB Output is correct
8 Correct 1201 ms 14276 KB Output is correct
9 Correct 1114 ms 13700 KB Output is correct
10 Correct 148 ms 12628 KB Output is correct
11 Correct 1223 ms 13256 KB Output is correct
12 Correct 81 ms 12768 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1693 ms 11956 KB Output is correct
2 Correct 1764 ms 14604 KB Output is correct
3 Correct 1732 ms 14460 KB Output is correct
4 Correct 1320 ms 13976 KB Output is correct
5 Correct 209 ms 13052 KB Output is correct
6 Correct 154 ms 12196 KB Output is correct
7 Correct 938 ms 13848 KB Output is correct
8 Correct 1201 ms 14276 KB Output is correct
9 Correct 1114 ms 13700 KB Output is correct
10 Correct 148 ms 12628 KB Output is correct
11 Correct 1223 ms 13256 KB Output is correct
12 Correct 81 ms 12768 KB Output is correct
13 Correct 1708 ms 14896 KB Output is correct
14 Correct 1735 ms 14708 KB Output is correct
15 Correct 1719 ms 14476 KB Output is correct
16 Correct 1396 ms 14068 KB Output is correct
17 Correct 242 ms 13392 KB Output is correct
18 Correct 165 ms 12524 KB Output is correct
19 Correct 1792 ms 14872 KB Output is correct
20 Correct 1707 ms 15092 KB Output is correct
21 Correct 1332 ms 14876 KB Output is correct
22 Correct 137 ms 12628 KB Output is correct
23 Correct 1212 ms 13604 KB Output is correct
24 Correct 82 ms 12768 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 20 ms 748 KB Output is correct
8 Correct 19 ms 748 KB Output is correct
9 Correct 20 ms 748 KB Output is correct
10 Correct 19 ms 748 KB Output is correct
11 Correct 16 ms 748 KB Output is correct
12 Correct 16 ms 748 KB Output is correct
13 Correct 19 ms 748 KB Output is correct
14 Correct 19 ms 748 KB Output is correct
15 Correct 19 ms 876 KB Output is correct
16 Correct 4 ms 748 KB Output is correct
17 Correct 16 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Correct 1693 ms 11956 KB Output is correct
20 Correct 1764 ms 14604 KB Output is correct
21 Correct 1732 ms 14460 KB Output is correct
22 Correct 1320 ms 13976 KB Output is correct
23 Correct 209 ms 13052 KB Output is correct
24 Correct 154 ms 12196 KB Output is correct
25 Correct 938 ms 13848 KB Output is correct
26 Correct 1201 ms 14276 KB Output is correct
27 Correct 1114 ms 13700 KB Output is correct
28 Correct 148 ms 12628 KB Output is correct
29 Correct 1223 ms 13256 KB Output is correct
30 Correct 81 ms 12768 KB Output is correct
31 Correct 1708 ms 14896 KB Output is correct
32 Correct 1735 ms 14708 KB Output is correct
33 Correct 1719 ms 14476 KB Output is correct
34 Correct 1396 ms 14068 KB Output is correct
35 Correct 242 ms 13392 KB Output is correct
36 Correct 165 ms 12524 KB Output is correct
37 Correct 1792 ms 14872 KB Output is correct
38 Correct 1707 ms 15092 KB Output is correct
39 Correct 1332 ms 14876 KB Output is correct
40 Correct 137 ms 12628 KB Output is correct
41 Correct 1212 ms 13604 KB Output is correct
42 Correct 82 ms 12768 KB Output is correct
43 Correct 1678 ms 16752 KB Output is correct
44 Correct 1698 ms 17192 KB Output is correct
45 Correct 1684 ms 16628 KB Output is correct
46 Correct 1316 ms 15356 KB Output is correct
47 Correct 231 ms 14524 KB Output is correct
48 Correct 154 ms 12164 KB Output is correct
49 Correct 960 ms 15996 KB Output is correct
50 Correct 1180 ms 16944 KB Output is correct
51 Correct 1111 ms 16024 KB Output is correct
52 Correct 163 ms 14300 KB Output is correct
53 Correct 1213 ms 14348 KB Output is correct