oj.uz

답안 #1108602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108602 2024-11-04T14:57:25 Z FubuGold Examination (JOI19_examination) C++14
43 / 100
 998 ms 486172 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 100000;
const int SQRT = 350;
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) {
        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);
    }
    for (int i=0;i<3;i++) clear_vec(compress[i]);
    int comp_a_sz = compress[0].size();
    point.assign(comp_a_sz+1,vector<int>());
    for (int i=1 / SQRT;i<=comp_a_sz / SQRT;i++) tree[i].init(compress[1].size());
    sort(query.begin(),query.end());
    int mx_b_id = comp_a_sz / SQRT;
    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:80:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     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 336 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 572 KB Output is correct
7 Correct 7 ms 1360 KB Output is correct
8 Correct 7 ms 1360 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 6 ms 848 KB Output is correct
11 Correct 4 ms 728 KB Output is correct
12 Correct 3 ms 728 KB Output is correct
13 Correct 8 ms 1364 KB Output is correct
14 Correct 8 ms 1360 KB Output is correct
15 Correct 8 ms 1360 KB Output is correct
16 Correct 3 ms 848 KB Output is correct
17 Correct 5 ms 848 KB Output is correct
18 Correct 2 ms 592 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 814 ms 95440 KB Output is correct
2 Correct 879 ms 95548 KB Output is correct
3 Correct 864 ms 98084 KB Output is correct
4 Correct 275 ms 13772 KB Output is correct
5 Correct 146 ms 11300 KB Output is correct
6 Correct 63 ms 10976 KB Output is correct
7 Correct 998 ms 78560 KB Output is correct
8 Correct 443 ms 79360 KB Output is correct
9 Correct 501 ms 64208 KB Output is correct
10 Correct 96 ms 11480 KB Output is correct
11 Correct 205 ms 13520 KB Output is correct
12 Correct 46 ms 10976 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 814 ms 95440 KB Output is correct
2 Correct 879 ms 95548 KB Output is correct
3 Correct 864 ms 98084 KB Output is correct
4 Correct 275 ms 13772 KB Output is correct
5 Correct 146 ms 11300 KB Output is correct
6 Correct 63 ms 10976 KB Output is correct
7 Correct 998 ms 78560 KB Output is correct
8 Correct 443 ms 79360 KB Output is correct
9 Correct 501 ms 64208 KB Output is correct
10 Correct 96 ms 11480 KB Output is correct
11 Correct 205 ms 13520 KB Output is correct
12 Correct 46 ms 10976 KB Output is correct
13 Correct 866 ms 98952 KB Output is correct
14 Correct 877 ms 98940 KB Output is correct
15 Correct 854 ms 97996 KB Output is correct
16 Correct 227 ms 14048 KB Output is correct
17 Correct 136 ms 11500 KB Output is correct
18 Correct 71 ms 10872 KB Output is correct
19 Correct 856 ms 98776 KB Output is correct
20 Correct 865 ms 98952 KB Output is correct
21 Correct 666 ms 84704 KB Output is correct
22 Correct 98 ms 11480 KB Output is correct
23 Correct 202 ms 13516 KB Output is correct
24 Correct 49 ms 10976 KB Output is correct

Subtask #4
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 336 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 572 KB Output is correct
7 Correct 7 ms 1360 KB Output is correct
8 Correct 7 ms 1360 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 6 ms 848 KB Output is correct
11 Correct 4 ms 728 KB Output is correct
12 Correct 3 ms 728 KB Output is correct
13 Correct 8 ms 1364 KB Output is correct
14 Correct 8 ms 1360 KB Output is correct
15 Correct 8 ms 1360 KB Output is correct
16 Correct 3 ms 848 KB Output is correct
17 Correct 5 ms 848 KB Output is correct
18 Correct 2 ms 592 KB Output is correct
19 Correct 814 ms 95440 KB Output is correct
20 Correct 879 ms 95548 KB Output is correct
21 Correct 864 ms 98084 KB Output is correct
22 Correct 275 ms 13772 KB Output is correct
23 Correct 146 ms 11300 KB Output is correct
24 Correct 63 ms 10976 KB Output is correct
25 Correct 998 ms 78560 KB Output is correct
26 Correct 443 ms 79360 KB Output is correct
27 Correct 501 ms 64208 KB Output is correct
28 Correct 96 ms 11480 KB Output is correct
29 Correct 205 ms 13520 KB Output is correct
30 Correct 46 ms 10976 KB Output is correct
31 Correct 866 ms 98952 KB Output is correct
32 Correct 877 ms 98940 KB Output is correct
33 Correct 854 ms 97996 KB Output is correct
34 Correct 227 ms 14048 KB Output is correct
35 Correct 136 ms 11500 KB Output is correct
36 Correct 71 ms 10872 KB Output is correct
37 Correct 856 ms 98776 KB Output is correct
38 Correct 865 ms 98952 KB Output is correct
39 Correct 666 ms 84704 KB Output is correct
40 Correct 98 ms 11480 KB Output is correct
41 Correct 202 ms 13516 KB Output is correct
42 Correct 49 ms 10976 KB Output is correct
43 Runtime error 525 ms 486172 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -