oj.uz

답안 #330894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330894 2020-11-26T20:24:13 Z 12tqian Examination (JOI19_examination) C++17
100 / 100
 2569 ms 373868 KB 
#include<bits/stdc++.h>
using namespace std;
const int SZ = (1 << 18);
// [0, SZ - 1) queries for each axis
template<class T> struct Node {
    T val = 0; 
    Node<T>* c[2];
    Node() { c[0] = c[1] = NULL; }
    void upd(int ind, T v, int L = 0, int R = SZ - 1) { // add v
        if (L == ind && R == ind) { val += v; return; }
        int M = (L + R) / 2;
        if (ind <= M) {
            if (!c[0]) c[0] = new Node();
            c[0]->upd(ind, v, L, M);
        } else {
            if (!c[1]) c[1] = new Node();
            c[1]->upd(ind, v, M + 1, R);
        }
        val = 0; 
        for (int i = 0; i < 2; i++)
            if (c[i]) val += c[i]->val;
    }
    T query(int lo, int hi, int L = 0, int R = SZ - 1) { // query sum of segment
        if (hi < L || R < lo) return 0;
        if (lo <= L && R <= hi) return val;
        int M = (L + R) / 2; 
        T res = 0;
        if (c[0]) res += c[0]->query(lo, hi, L, M);
        if (c[1]) res += c[1]->query(lo, hi, M + 1, R);
        return res;
    }
    void update_2d(int ind, Node* c0, Node* c1, int L = 0, int R = SZ - 1) { // for 2D segtree
        if (L != R) {
            int M = (L + R) / 2;
            if (ind <= M) {
                if (!c[0]) c[0] = new Node();
                c[0]->update_2d(ind, (c0 ? c0->c[0] : NULL), (c1 ? c1->c[0] : NULL), L, M);
            } else {
                if (!c[1]) c[1] = new Node();
                c[1]->update_2d(ind, (c0 ? c0->c[1] : NULL), (c1 ? c1->c[1] : NULL), M + 1, R);
            }
        } 
        val = (c0 ? c0->val : 0) + (c1 ? c1->val : 0);
    }
};
template<class T> struct BITSeg { // 0-indexed implicitly
    std::vector<Node<T>> seg;
    BITSeg() { 
        seg.resize(SZ + 1);
        for (int i = 0; i < SZ; i++)
            seg[i] = Node<T>();
    }
    void upd(int x, int y, int v) { // add v
        x++;
        for (; x < SZ + 1; x += x & -x) 
            seg[x].upd(y, v); 
    }
    T query(int x, int y1, int y2) {
        if (x <= 0) return 0;
        T res = 0; 
        for (; x; x -= x & -x) 
            res += seg[x].query(y1, y2);
        return res; 
    }
    T query(int x1, int x2, int y1, int y2) { // query sum of rectangle
        x1++, x2++;
        return query(x2, y1, y2) - query(x1 - 1, y1, y2); 
    }
};
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, q; cin >> n >> q;
    vector<array<int, 2>> v(n);
    set<int> xs, ys;
    for (int i = 0; i < n; i++) {
        cin >> v[i][0] >> v[i][1];
        xs.insert(v[i][0]);
        ys.insert(v[i][1]);
    }
    vector<int> ans(q);
    vector<array<int, 4>> queries(q);
    for (int i = 0; i < q; i++) {
        queries[i][0] = i;
        cin >> queries[i][1] >> queries[i][2] >> queries[i][3];
        xs.insert(queries[i][1]);
        ys.insert(queries[i][2]);
    }
    map<int, int> mx, my;
    int cnt = 0;
    for (int x : xs) 
        mx[x] = cnt, cnt++;
    cnt = 0;
    for (int y : ys)
        my[y] = cnt, cnt++;
    sort(queries.begin(), queries.end(), [](array<int, 4> a, array<int, 4> b) {
        return a[3] < b[3];
    });
    sort(v.begin(), v.end(), [](array<int, 2> a, array<int, 2> b) {
        return a[0] + a[1] < b[0] + b[1];
    });
    BITSeg<int> seg;
    int qv = n;
    for (int i = q - 1; i >= 0; i--) {
        int sum = queries[i][3];
        while (qv > 0 && v[qv - 1][0] + v[qv - 1][1] >= sum) {
            qv--;
            seg.upd(mx[v[qv][0]], my[v[qv][1]], 1);
        }
        ans[queries[i][0]] = seg.query(mx[queries[i][1]], SZ - 1, my[queries[i][2]], SZ - 1);
    }
    for (int i = 0; i < q; i++) 
        cout << ans[i] << '\n';
    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6508 KB Output is correct
2 Correct 5 ms 6508 KB Output is correct
3 Correct 5 ms 6508 KB Output is correct
4 Correct 5 ms 6508 KB Output is correct
5 Correct 5 ms 6508 KB Output is correct
6 Correct 5 ms 6508 KB Output is correct
7 Correct 40 ms 15212 KB Output is correct
8 Correct 38 ms 15212 KB Output is correct
9 Correct 38 ms 15212 KB Output is correct
10 Correct 20 ms 9708 KB Output is correct
11 Correct 26 ms 12012 KB Output is correct
12 Correct 13 ms 6636 KB Output is correct
13 Correct 39 ms 15212 KB Output is correct
14 Correct 39 ms 15220 KB Output is correct
15 Correct 39 ms 15232 KB Output is correct
16 Correct 25 ms 12012 KB Output is correct
17 Correct 18 ms 9452 KB Output is correct
18 Correct 11 ms 6636 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2244 ms 289420 KB Output is correct
2 Correct 2262 ms 289380 KB Output is correct
3 Correct 2253 ms 289388 KB Output is correct
4 Correct 706 ms 70124 KB Output is correct
5 Correct 743 ms 109804 KB Output is correct
6 Correct 267 ms 9836 KB Output is correct
7 Correct 1847 ms 276844 KB Output is correct
8 Correct 2067 ms 276588 KB Output is correct
9 Correct 1579 ms 265196 KB Output is correct
10 Correct 661 ms 104940 KB Output is correct
11 Correct 490 ms 59180 KB Output is correct
12 Correct 232 ms 9452 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2244 ms 289420 KB Output is correct
2 Correct 2262 ms 289380 KB Output is correct
3 Correct 2253 ms 289388 KB Output is correct
4 Correct 706 ms 70124 KB Output is correct
5 Correct 743 ms 109804 KB Output is correct
6 Correct 267 ms 9836 KB Output is correct
7 Correct 1847 ms 276844 KB Output is correct
8 Correct 2067 ms 276588 KB Output is correct
9 Correct 1579 ms 265196 KB Output is correct
10 Correct 661 ms 104940 KB Output is correct
11 Correct 490 ms 59180 KB Output is correct
12 Correct 232 ms 9452 KB Output is correct
13 Correct 2037 ms 289168 KB Output is correct
14 Correct 2247 ms 290016 KB Output is correct
15 Correct 2252 ms 289516 KB Output is correct
16 Correct 627 ms 70380 KB Output is correct
17 Correct 704 ms 110060 KB Output is correct
18 Correct 275 ms 9964 KB Output is correct
19 Correct 2028 ms 289280 KB Output is correct
20 Correct 2127 ms 289372 KB Output is correct
21 Correct 1755 ms 280812 KB Output is correct
22 Correct 647 ms 105068 KB Output is correct
23 Correct 498 ms 59116 KB Output is correct
24 Correct 233 ms 9452 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6508 KB Output is correct
2 Correct 5 ms 6508 KB Output is correct
3 Correct 5 ms 6508 KB Output is correct
4 Correct 5 ms 6508 KB Output is correct
5 Correct 5 ms 6508 KB Output is correct
6 Correct 5 ms 6508 KB Output is correct
7 Correct 40 ms 15212 KB Output is correct
8 Correct 38 ms 15212 KB Output is correct
9 Correct 38 ms 15212 KB Output is correct
10 Correct 20 ms 9708 KB Output is correct
11 Correct 26 ms 12012 KB Output is correct
12 Correct 13 ms 6636 KB Output is correct
13 Correct 39 ms 15212 KB Output is correct
14 Correct 39 ms 15220 KB Output is correct
15 Correct 39 ms 15232 KB Output is correct
16 Correct 25 ms 12012 KB Output is correct
17 Correct 18 ms 9452 KB Output is correct
18 Correct 11 ms 6636 KB Output is correct
19 Correct 2244 ms 289420 KB Output is correct
20 Correct 2262 ms 289380 KB Output is correct
21 Correct 2253 ms 289388 KB Output is correct
22 Correct 706 ms 70124 KB Output is correct
23 Correct 743 ms 109804 KB Output is correct
24 Correct 267 ms 9836 KB Output is correct
25 Correct 1847 ms 276844 KB Output is correct
26 Correct 2067 ms 276588 KB Output is correct
27 Correct 1579 ms 265196 KB Output is correct
28 Correct 661 ms 104940 KB Output is correct
29 Correct 490 ms 59180 KB Output is correct
30 Correct 232 ms 9452 KB Output is correct
31 Correct 2037 ms 289168 KB Output is correct
32 Correct 2247 ms 290016 KB Output is correct
33 Correct 2252 ms 289516 KB Output is correct
34 Correct 627 ms 70380 KB Output is correct
35 Correct 704 ms 110060 KB Output is correct
36 Correct 275 ms 9964 KB Output is correct
37 Correct 2028 ms 289280 KB Output is correct
38 Correct 2127 ms 289372 KB Output is correct
39 Correct 1755 ms 280812 KB Output is correct
40 Correct 647 ms 105068 KB Output is correct
41 Correct 498 ms 59116 KB Output is correct
42 Correct 233 ms 9452 KB Output is correct
43 Correct 2370 ms 373492 KB Output is correct
44 Correct 2350 ms 373868 KB Output is correct
45 Correct 2569 ms 373308 KB Output is correct
46 Correct 813 ms 116460 KB Output is correct
47 Correct 967 ms 189288 KB Output is correct
48 Correct 254 ms 9704 KB Output is correct
49 Correct 2190 ms 354620 KB Output is correct
50 Correct 2168 ms 357580 KB Output is correct
51 Correct 1937 ms 338664 KB Output is correct
52 Correct 944 ms 190292 KB Output is correct
53 Correct 696 ms 105196 KB Output is correct