oj.uz

답안 #1108588

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108588 2024-11-04T14:08:50 Z FubuGold Examination (JOI19_examination) C++14
2 / 100
 892 ms 98000 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]);
    point.assign(compress[0].size()+1,vector<int>());
    for (int i=1 / SQRT;i<=compress[0].size() / SQRT;i++) tree[i].init(compress[0].size());
    sort(query.begin(),query.end());
    int mx_b_id = compress[0].size() / 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 <= compress[0].size();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:76:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for (int i=1 / SQRT;i<=compress[0].size() / SQRT;i++) tree[i].init(compress[0].size());
      |                         ~^~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:79:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for (int qr_id = 0; qr_id < query.size();qr_id++) {
      |                         ~~~~~~^~~~~~~~~~~~~~
examination.cpp:97:56: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |             for (int i = qr.a; i / SQRT == cur_id && i <= compress[0].size();i++) {
      |                                                      ~~^~~~~~~~~~~~~~~~~~~~~

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 504 KB Output is correct
7 Correct 8 ms 1360 KB Output is correct
8 Correct 8 ms 1360 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 6 ms 1360 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 3 ms 848 KB Output is correct
13 Correct 9 ms 1360 KB Output is correct
14 Correct 8 ms 1360 KB Output is correct
15 Correct 9 ms 1360 KB Output is correct
16 Correct 5 ms 908 KB Output is correct
17 Correct 6 ms 1360 KB Output is correct
18 Correct 2 ms 848 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 885 ms 97996 KB Output is correct
2 Incorrect 892 ms 98000 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 885 ms 97996 KB Output is correct
2 Incorrect 892 ms 98000 KB Output isn't correct
3 Halted 0 ms 0 KB -

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 504 KB Output is correct
7 Correct 8 ms 1360 KB Output is correct
8 Correct 8 ms 1360 KB Output is correct
9 Correct 7 ms 1360 KB Output is correct
10 Correct 6 ms 1360 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 3 ms 848 KB Output is correct
13 Correct 9 ms 1360 KB Output is correct
14 Correct 8 ms 1360 KB Output is correct
15 Correct 9 ms 1360 KB Output is correct
16 Correct 5 ms 908 KB Output is correct
17 Correct 6 ms 1360 KB Output is correct
18 Correct 2 ms 848 KB Output is correct
19 Correct 885 ms 97996 KB Output is correct
20 Incorrect 892 ms 98000 KB Output isn't correct
21 Halted 0 ms 0 KB -