oj.uz

Submission #998036

# Submission time Handle Problem Language Result Execution time Memory
998036 2024-06-13T08:38:03 Z vjudge1 Examination (JOI19_examination) C++17
100 / 100
 549 ms 45160 KB 
#include <bits/stdc++.h>

#define int long long
#define ll long long
#define pb push_back

using namespace std;

struct point{
    int a, b, c, id, val;
};
vector<point> student;
const int maxn = 1e6 + 10;
int ans[maxn];

bool cmp(point x, point y){
    if(x.a != y.a) return x.a > y.a;
    if(x.b != y.b) return x.b < y.b;
    return x.c < y.c;
}

void inv(point &a){
    a.a = -a.a;
    a.b = -a.b;
    a.c = -a.c;
}

int bit[maxn];

int getsum(int i){
    ll sum = 0;
    while(i > 0){
        sum+=bit[i];
        i-=(i & (-i));
    }
    return sum;
}

void update(int i, int v){
    while(i < maxn){
        bit[i]+=v;
        i+=(i & (-i));
    }
}

void dnc(int l, int r){
    if(l + 1 == r) return;
    int mid = (l + r)/2;
    dnc(l , mid); dnc(mid, r);
    vector<pair<int,int>> rec; vector<point> tmp;
    int a = l, b = mid, sum = 0;

    while(a < mid && b < r) {
        if(student[a].b > student[b].b){
            update(student[a].c, student[a].val);
            sum+=student[a].val;
            rec.push_back({student[a].c,student[a].val});
            tmp.push_back(student[a++]);
        }
        else{
            ans[student[b].id] += sum - getsum(student[b].c);
            tmp.push_back(student[b++]);
        }
    }
    while(a < mid) tmp.push_back(student[a++]);
    while(b < r) ans[student[b].id] += sum - getsum(student[b].c), tmp.push_back(student[b++]);
    for(int i = l ; i < r ; ++i) student[i] = tmp[i - l];

    for(auto x: rec) update(x.first, -x.second);
    vector<pair<int,int>> ().swap(rec);
    vector<point> ().swap(tmp);
}


signed main(){
    int n, q;
    cin >> n >> q;
    vector<int> compress;
    compress.pb(-1e18); compress.pb(1e18);
    for(int i = 0; i < n; i++){
        point tmp; cin >> tmp.a >> tmp.b;
        tmp.c = tmp.a + tmp.b; tmp.id = 0; tmp.val = 1;
        // inv(tmp);
        compress.pb(tmp.a);compress.pb(tmp.b);compress.pb(tmp.c);
        student.pb(tmp);
    }

    int cnt = 1;
    int _q = q;
    while(q--){
        point tmp;
        cin >> tmp.a >> tmp.b >> tmp.c;
        tmp.a--; tmp.b--; tmp.c--;
        tmp.val = 0 ;
        compress.pb(tmp.a); compress.pb(tmp.b); compress.pb(tmp.c);
        tmp.id = cnt;
        // inv(tmp);
        cnt++;
        student.pb(tmp);
    }
    sort(compress.begin(),compress.end());
    for(auto &x : student){
        x.a = lower_bound(compress.begin(),compress.end(),x.a) - compress.begin();
        x.b = lower_bound(compress.begin(),compress.end(),x.b) - compress.begin();
        x.c = lower_bound(compress.begin(),compress.end(),x.c) - compress.begin();
    }
    sort(student.begin(),student.end(), cmp);

    dnc(0, n + _q);

    for(int i = 1; i <= _q; i++){
        cout << ans[i] << "\n";
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 16 ms 7632 KB Output is correct
8 Correct 13 ms 7580 KB Output is correct
9 Correct 12 ms 7500 KB Output is correct
10 Correct 13 ms 7504 KB Output is correct
11 Correct 9 ms 7504 KB Output is correct
12 Correct 7 ms 7504 KB Output is correct
13 Correct 12 ms 7576 KB Output is correct
14 Correct 12 ms 7576 KB Output is correct
15 Correct 13 ms 7504 KB Output is correct
16 Correct 7 ms 7460 KB Output is correct
17 Correct 10 ms 7500 KB Output is correct
18 Correct 6 ms 7364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 43644 KB Output is correct
2 Correct 489 ms 44672 KB Output is correct
3 Correct 481 ms 42988 KB Output is correct
4 Correct 405 ms 41296 KB Output is correct
5 Correct 289 ms 40548 KB Output is correct
6 Correct 233 ms 37212 KB Output is correct
7 Correct 426 ms 44108 KB Output is correct
8 Correct 462 ms 43372 KB Output is correct
9 Correct 418 ms 42504 KB Output is correct
10 Correct 249 ms 39504 KB Output is correct
11 Correct 341 ms 42380 KB Output is correct
12 Correct 184 ms 42136 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 43644 KB Output is correct
2 Correct 489 ms 44672 KB Output is correct
3 Correct 481 ms 42988 KB Output is correct
4 Correct 405 ms 41296 KB Output is correct
5 Correct 289 ms 40548 KB Output is correct
6 Correct 233 ms 37212 KB Output is correct
7 Correct 426 ms 44108 KB Output is correct
8 Correct 462 ms 43372 KB Output is correct
9 Correct 418 ms 42504 KB Output is correct
10 Correct 249 ms 39504 KB Output is correct
11 Correct 341 ms 42380 KB Output is correct
12 Correct 184 ms 42136 KB Output is correct
13 Correct 497 ms 45160 KB Output is correct
14 Correct 453 ms 43956 KB Output is correct
15 Correct 478 ms 43104 KB Output is correct
16 Correct 379 ms 43360 KB Output is correct
17 Correct 317 ms 41224 KB Output is correct
18 Correct 194 ms 38684 KB Output is correct
19 Correct 465 ms 44260 KB Output is correct
20 Correct 466 ms 43596 KB Output is correct
21 Correct 445 ms 43408 KB Output is correct
22 Correct 249 ms 40556 KB Output is correct
23 Correct 332 ms 44124 KB Output is correct
24 Correct 181 ms 41304 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 16 ms 7632 KB Output is correct
8 Correct 13 ms 7580 KB Output is correct
9 Correct 12 ms 7500 KB Output is correct
10 Correct 13 ms 7504 KB Output is correct
11 Correct 9 ms 7504 KB Output is correct
12 Correct 7 ms 7504 KB Output is correct
13 Correct 12 ms 7576 KB Output is correct
14 Correct 12 ms 7576 KB Output is correct
15 Correct 13 ms 7504 KB Output is correct
16 Correct 7 ms 7460 KB Output is correct
17 Correct 10 ms 7500 KB Output is correct
18 Correct 6 ms 7364 KB Output is correct
19 Correct 476 ms 43644 KB Output is correct
20 Correct 489 ms 44672 KB Output is correct
21 Correct 481 ms 42988 KB Output is correct
22 Correct 405 ms 41296 KB Output is correct
23 Correct 289 ms 40548 KB Output is correct
24 Correct 233 ms 37212 KB Output is correct
25 Correct 426 ms 44108 KB Output is correct
26 Correct 462 ms 43372 KB Output is correct
27 Correct 418 ms 42504 KB Output is correct
28 Correct 249 ms 39504 KB Output is correct
29 Correct 341 ms 42380 KB Output is correct
30 Correct 184 ms 42136 KB Output is correct
31 Correct 497 ms 45160 KB Output is correct
32 Correct 453 ms 43956 KB Output is correct
33 Correct 478 ms 43104 KB Output is correct
34 Correct 379 ms 43360 KB Output is correct
35 Correct 317 ms 41224 KB Output is correct
36 Correct 194 ms 38684 KB Output is correct
37 Correct 465 ms 44260 KB Output is correct
38 Correct 466 ms 43596 KB Output is correct
39 Correct 445 ms 43408 KB Output is correct
40 Correct 249 ms 40556 KB Output is correct
41 Correct 332 ms 44124 KB Output is correct
42 Correct 181 ms 41304 KB Output is correct
43 Correct 549 ms 42452 KB Output is correct
44 Correct 498 ms 42864 KB Output is correct
45 Correct 527 ms 43416 KB Output is correct
46 Correct 406 ms 41204 KB Output is correct
47 Correct 338 ms 40460 KB Output is correct
48 Correct 200 ms 40620 KB Output is correct
49 Correct 474 ms 44296 KB Output is correct
50 Correct 493 ms 44268 KB Output is correct
51 Correct 469 ms 41412 KB Output is correct
52 Correct 314 ms 40560 KB Output is correct
53 Correct 350 ms 42344 KB Output is correct