oj.uz

답안 #1108607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108607 2024-11-04T15:10:59 Z FubuGold Examination (JOI19_examination) C++14
100 / 100
 2721 ms 412136 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 200000;
const int SQRT = 400;
const int NUM_B = MAXN / SQRT;

struct BIT {
    vector<int> tree;
    int n;
    int total_sum;
    void init(int n) {
        this->n = n;
        total_sum = 0;
        tree.assign(n+1,0);
    }
    void update(int pos,int val) {
        total_sum += val;
        for (;pos <= n;pos += pos & (-pos)) tree[pos] += val;
    }
    int query(int pos) {
        int sum = 0;
        for (;pos > 0;pos -= pos & (-pos)) sum += tree[pos];
        return sum;
    }
    int suf_query(int pos) {
        assert(pos <= n);
        return total_sum - query(pos-1);
    }
} tree[NUM_B+2];

vector<int> compress[3];
vector<vector<int>> point;
void clear_vec(vector<int> &vec) {
    sort(vec.begin(),vec.end());
    vec.erase(unique(vec.begin(),vec.end()),vec.end());
}
int get_id(int x,vector<int> &vec) {
    return lower_bound(vec.begin(),vec.end(),x) - vec.begin() + 1;
}
struct Query {
    int a,b,c,id,type;
    bool operator < (const Query &qr) {
        if (c == qr.c) return type < qr.type;
        return c > qr.c;
    }
};
vector<Query> query;
int n,q;
int ans[MAXN+1];

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cin >> n >> q;
    for (int i=1;i<=n;i++) {
        Query qr; cin >> qr.a >> qr.b;
        qr.id = i;
        qr.type = 0;
        qr.c = qr.a + qr.b;
        compress[0].push_back(qr.a);
        compress[1].push_back(qr.b);
        compress[2].push_back(qr.c);
        query.push_back(qr);
    }
    for (int i=1;i<=q;i++) {
        Query qr; cin >> qr.a >> qr.b >> qr.c;
        qr.id = i;
        qr.type = 1;
        compress[0].push_back(qr.a);
        compress[1].push_back(qr.b);
        compress[2].push_back(qr.c);
        query.push_back(qr);
    }

    sort(query.begin(),query.end());
    for (int i=0;i<3;i++) clear_vec(compress[i]);
    int comp_a_sz = compress[0].size();
    point.assign(comp_a_sz+10,vector<int>());
    int mx_b_id = comp_a_sz / SQRT;
    for (int i=1 / SQRT;i<=mx_b_id;i++) tree[i].init(compress[1].size()+1);

    for (int qr_id = 0; qr_id < query.size();qr_id++) {
        Query qr = query[qr_id];
//        cerr << qr_id << ' ' << qr.type << ' ' << qr.id << '\n';
        qr.a = get_id(qr.a,compress[0]);
        qr.b = get_id(qr.b,compress[1]);
        qr.c = get_id(qr.c,compress[2]);
        if (qr.type == 0) {
            tree[qr.a / SQRT].update(qr.b,1);
//            assert(point[qr.a].empty() || point[qr.a].back() >= qr.b);
            point[qr.a].push_back(qr.b);
        }
        else {
            int cur_id = qr.a / SQRT;
            int cnt = 0;
            for (int i = cur_id + 1; i <= mx_b_id;i++) {
                cnt += tree[i].suf_query(qr.b);
            }
//            cerr << "ok1\n";
            for (int i = qr.a; i / SQRT == cur_id && i <= comp_a_sz;i++) {
//                cerr << i << ' ' << point.size() << ' ' << '\n';
//                cerr << ' ' << upper_bound(point[i].begin(),point[i].end(),qr.b,greater<int>()) - point[i].begin() << '\n';
                cnt += upper_bound(point[i].begin(),point[i].end(),qr.b,greater<int>()) - point[i].begin();
            }
            ans[qr.id] = cnt;
        }
    }
    for (int i=1;i<=q;i++) cout << ans[i] << '\n';
    return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:83:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (int qr_id = 0; qr_id < query.size();qr_id++) {
      |                         ~~~~~~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 8 ms 1116 KB Output is correct
8 Correct 8 ms 1104 KB Output is correct
9 Correct 9 ms 1104 KB Output is correct
10 Correct 7 ms 984 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 3 ms 848 KB Output is correct
13 Correct 8 ms 1328 KB Output is correct
14 Correct 9 ms 1104 KB Output is correct
15 Correct 9 ms 1104 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 6 ms 848 KB Output is correct
18 Correct 2 ms 848 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 996 ms 85448 KB Output is correct
2 Correct 978 ms 85424 KB Output is correct
3 Correct 991 ms 85620 KB Output is correct
4 Correct 306 ms 11984 KB Output is correct
5 Correct 149 ms 10208 KB Output is correct
6 Correct 65 ms 10208 KB Output is correct
7 Correct 1060 ms 68048 KB Output is correct
8 Correct 471 ms 68932 KB Output is correct
9 Correct 457 ms 55484 KB Output is correct
10 Correct 97 ms 10208 KB Output is correct
11 Correct 235 ms 11836 KB Output is correct
12 Correct 52 ms 10208 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 996 ms 85448 KB Output is correct
2 Correct 978 ms 85424 KB Output is correct
3 Correct 991 ms 85620 KB Output is correct
4 Correct 306 ms 11984 KB Output is correct
5 Correct 149 ms 10208 KB Output is correct
6 Correct 65 ms 10208 KB Output is correct
7 Correct 1060 ms 68048 KB Output is correct
8 Correct 471 ms 68932 KB Output is correct
9 Correct 457 ms 55484 KB Output is correct
10 Correct 97 ms 10208 KB Output is correct
11 Correct 235 ms 11836 KB Output is correct
12 Correct 52 ms 10208 KB Output is correct
13 Correct 913 ms 85424 KB Output is correct
14 Correct 924 ms 85452 KB Output is correct
15 Correct 929 ms 85200 KB Output is correct
16 Correct 235 ms 12144 KB Output is correct
17 Correct 135 ms 10220 KB Output is correct
18 Correct 73 ms 10208 KB Output is correct
19 Correct 899 ms 85632 KB Output is correct
20 Correct 907 ms 85464 KB Output is correct
21 Correct 798 ms 73164 KB Output is correct
22 Correct 94 ms 10208 KB Output is correct
23 Correct 218 ms 11828 KB Output is correct
24 Correct 44 ms 10208 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 8 ms 1116 KB Output is correct
8 Correct 8 ms 1104 KB Output is correct
9 Correct 9 ms 1104 KB Output is correct
10 Correct 7 ms 984 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 3 ms 848 KB Output is correct
13 Correct 8 ms 1328 KB Output is correct
14 Correct 9 ms 1104 KB Output is correct
15 Correct 9 ms 1104 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 6 ms 848 KB Output is correct
18 Correct 2 ms 848 KB Output is correct
19 Correct 996 ms 85448 KB Output is correct
20 Correct 978 ms 85424 KB Output is correct
21 Correct 991 ms 85620 KB Output is correct
22 Correct 306 ms 11984 KB Output is correct
23 Correct 149 ms 10208 KB Output is correct
24 Correct 65 ms 10208 KB Output is correct
25 Correct 1060 ms 68048 KB Output is correct
26 Correct 471 ms 68932 KB Output is correct
27 Correct 457 ms 55484 KB Output is correct
28 Correct 97 ms 10208 KB Output is correct
29 Correct 235 ms 11836 KB Output is correct
30 Correct 52 ms 10208 KB Output is correct
31 Correct 913 ms 85424 KB Output is correct
32 Correct 924 ms 85452 KB Output is correct
33 Correct 929 ms 85200 KB Output is correct
34 Correct 235 ms 12144 KB Output is correct
35 Correct 135 ms 10220 KB Output is correct
36 Correct 73 ms 10208 KB Output is correct
37 Correct 899 ms 85632 KB Output is correct
38 Correct 907 ms 85464 KB Output is correct
39 Correct 798 ms 73164 KB Output is correct
40 Correct 94 ms 10208 KB Output is correct
41 Correct 218 ms 11828 KB Output is correct
42 Correct 44 ms 10208 KB Output is correct
43 Correct 2167 ms 407228 KB Output is correct
44 Correct 2152 ms 412136 KB Output is correct
45 Correct 2301 ms 412032 KB Output is correct
46 Correct 278 ms 19148 KB Output is correct
47 Correct 154 ms 12880 KB Output is correct
48 Correct 68 ms 10976 KB Output is correct
49 Correct 2721 ms 411856 KB Output is correct
50 Correct 2025 ms 411764 KB Output is correct
51 Correct 2607 ms 411768 KB Output is correct
52 Correct 122 ms 12752 KB Output is correct
53 Correct 245 ms 18120 KB Output is correct