oj.uz

Submission #375074

# Submission time Handle Problem Language Result Execution time Memory
375074 2021-03-09T02:12:00 Z wiwiho Examination (JOI19_examination) C++14
2 / 100
 3000 ms 11372 KB 
#include <bits/stdc++.h>

#define eb emplace_back
#define iter(a) a.begin(), a.end()
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

typedef long long ll;

vector<int> BIT;

int lowbit(int x){
    return x & -x;
}

void modify(int x, int v){
    for(; x < BIT.size(); x += lowbit(x)){
        BIT[x] += v;
    }
}

int query(int x){
    int ans = 0;
    for(; x > 0; x -= lowbit(x)){
        ans += BIT[x];
    }
    return ans;
}

vector<int> tv;

struct OAO{
    int x = 0, y = 0, z = 0, type = -1;
    OAO(int x = 0, int y = 0, int z = 0, int type = -1):
            x(x), y(y), z(z), type(type) {}
    void upd(){
        x = lower_bound(iter(tv), x, greater<>()) - tv.begin() + 1;
        y = lower_bound(iter(tv), y, greater<>()) - tv.begin() + 1;
        z = lower_bound(iter(tv), z, greater<>()) - tv.begin() + 1;
    }
};

bool comp(OAO a, OAO b){
    if(a.x == b.x) return a.type == -1;
    return a.x < b.x;
}

ostream& operator<<(ostream& o, OAO oao){
    return o << '(' << oao.x << ',' << oao.y << ',' << oao.z << ',' << oao.type << ')';
}

vector<int> ans;
vector<OAO> b;
vector<int> cnt;
void cdq(vector<OAO>& a, int l, int r){
    if(l >= r) return;
    int m = (l + r) / 2;
    cdq(a, l, m);
    cdq(a, m + 1, r);
    //cerr << "test " << l << " " << r << "\n";
    //printv(a, cerr);
    //for(int i = 1; i < BIT.size(); i++) cerr << query(i) << " ";
    //cerr << "\n";

    int lp = l, rp = m + 1;
    int bp = l;
    while(lp <= m && rp <= r){
        if(a[lp].y <= a[rp].y){
            if(a[lp].type == -1){
                modify(a[lp].z, 1);
            }
            b[bp] = a[lp];
            lp++;
        }
        else{
            if(a[rp].type != -1){
                ans[a[rp].type] += query(a[rp].z);
            }
            b[bp] = a[rp];
            rp++;
        }
        bp++;
    }
    while(lp <= m){
        if(a[lp].type == -1){
            modify(a[lp].z, 1);
        }
        b[bp] = a[lp];
        lp++;
        bp++;
    }
    while(rp <= r){
        if(a[rp].type != -1){
            ans[a[rp].type] += query(a[rp].z);
        }
        b[bp] = a[rp];
        rp++;
        bp++;
    }

    for(int i = l; i <= m; i++){
        if(a[i].type == -1) modify(a[i].z, -1);
    }

    for(int i = l; i <= r; i++){
        a[i] = b[i];
        cnt[i]++;
        assert(cnt[i] <= 20);
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, q;
    cin >> n >> q;
    ans.resize(q);
    tv.reserve(3 * (n + q));
    
    vector<OAO> a;
    a.reserve(n + q);
    for(int i = 0; i < n; i++){
        int s, t;
        cin >> s >> t;
        a.eb(OAO(s, t, s + t, -1));
        tv.eb(s);
        tv.eb(t);
        tv.eb(s + t);
    }

    for(int i = 0; i < q; i++){
        int x, y, z;
        cin >> x >> y >> z;
        a.eb(OAO(x, y, z, i));
        tv.eb(x);
        tv.eb(y);
        tv.eb(z);
    }

    sort(iter(tv), greater<>());
    tv.resize(unique(iter(tv)) - tv.begin());
    BIT.resize(tv.size() + 1);
    b.resize(a.size());
    cnt.resize(a.size());

    for(auto& i : a){
        i.upd();
    }
    sort(iter(a), comp);
    //printv(tv, cerr);

    cdq(a, 0, (int)a.size() - 1);

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

    return 0;
}

Compilation message

examination.cpp: In function 'void modify(int, int)':
examination.cpp:21:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(; x < BIT.size(); x += lowbit(x)){
      |           ~~^~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 0 ms 364 KB Output is correct
7 Correct 9 ms 748 KB Output is correct
8 Correct 10 ms 748 KB Output is correct
9 Correct 9 ms 748 KB Output is correct
10 Correct 8 ms 748 KB Output is correct
11 Correct 10 ms 748 KB Output is correct
12 Correct 7 ms 620 KB Output is correct
13 Correct 9 ms 748 KB Output is correct
14 Correct 9 ms 748 KB Output is correct
15 Correct 8 ms 748 KB Output is correct
16 Correct 19 ms 620 KB Output is correct
17 Correct 7 ms 620 KB Output is correct
18 Correct 20 ms 620 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 11244 KB Output is correct
2 Correct 314 ms 11372 KB Output is correct
3 Correct 317 ms 11244 KB Output is correct
4 Correct 277 ms 11116 KB Output is correct
5 Correct 1701 ms 11116 KB Output is correct
6 Correct 1583 ms 10732 KB Output is correct
7 Correct 294 ms 11244 KB Output is correct
8 Correct 293 ms 11264 KB Output is correct
9 Correct 285 ms 11300 KB Output is correct
10 Execution timed out 3089 ms 10476 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 11244 KB Output is correct
2 Correct 314 ms 11372 KB Output is correct
3 Correct 317 ms 11244 KB Output is correct
4 Correct 277 ms 11116 KB Output is correct
5 Correct 1701 ms 11116 KB Output is correct
6 Correct 1583 ms 10732 KB Output is correct
7 Correct 294 ms 11244 KB Output is correct
8 Correct 293 ms 11264 KB Output is correct
9 Correct 285 ms 11300 KB Output is correct
10 Execution timed out 3089 ms 10476 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 0 ms 364 KB Output is correct
7 Correct 9 ms 748 KB Output is correct
8 Correct 10 ms 748 KB Output is correct
9 Correct 9 ms 748 KB Output is correct
10 Correct 8 ms 748 KB Output is correct
11 Correct 10 ms 748 KB Output is correct
12 Correct 7 ms 620 KB Output is correct
13 Correct 9 ms 748 KB Output is correct
14 Correct 9 ms 748 KB Output is correct
15 Correct 8 ms 748 KB Output is correct
16 Correct 19 ms 620 KB Output is correct
17 Correct 7 ms 620 KB Output is correct
18 Correct 20 ms 620 KB Output is correct
19 Correct 318 ms 11244 KB Output is correct
20 Correct 314 ms 11372 KB Output is correct
21 Correct 317 ms 11244 KB Output is correct
22 Correct 277 ms 11116 KB Output is correct
23 Correct 1701 ms 11116 KB Output is correct
24 Correct 1583 ms 10732 KB Output is correct
25 Correct 294 ms 11244 KB Output is correct
26 Correct 293 ms 11264 KB Output is correct
27 Correct 285 ms 11300 KB Output is correct
28 Execution timed out 3089 ms 10476 KB Time limit exceeded
29 Halted 0 ms 0 KB -