oj.uz

Submission #959381

# Submission time Handle Problem Language Result Execution time Memory
959381 2024-04-08T06:24:57 Z irmuun Examination (JOI19_examination) C++17
100 / 100
 920 ms 71536 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

struct segtree{
    ll n;
    vector<ll>d;
    segtree(ll n):n(n){
        d.resize(4*n);
        build(1,0,n);
    }
    void build(ll node,ll l,ll r){
        if(l==r){
            d[node]=0;
            return;
        }
        ll mid=(l+r)/2;
        build(node*2,l,mid);
        build(node*2+1,mid+1,r);
        d[node]=d[node*2]+d[node*2+1];
    }
    ll query(ll node,ll l,ll r,ll L,ll R){
        if(l > R || r < L || L > R){
            return 0ll;
        }
        if(L <= l && r <= R){
            return d[node];
        }
        ll mid=(l+r)/2;
        return query(node*2,l,mid,L,R)+query(node*2+1,mid+1,r,L,R);
    }
    void update(ll node,ll l,ll r,ll k,ll val){
        if(l>k || r<k)return;
        if(l==r){
            d[node]+=val;
            return;
        }
        ll mid=(l+r)/2;
        update(node*2,l,mid,k,val);
        update(node*2+1,mid+1,r,k,val);
        d[node]=d[node*2]+d[node*2+1];
    }
    void set(ll node,ll l,ll r,ll k,ll val){
        if(l>k || r<k)return;
        if(l==r){
            d[node]=val;
            return;
        }
        ll mid=(l+r)/2;
        set(node*2,l,mid,k,val);
        set(node*2+1,mid+1,r,k,val);
        d[node]=d[node*2]+d[node*2+1];
    }
};

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    const ll N=2e5;
    ll n,q;
    cin>>n>>q;
    ll s[n],t[n];
    set<ll>S,T,Z;
    for(ll i=0;i<n;i++){
        cin>>s[i]>>t[i];
        S.insert(s[i]);
        T.insert(t[i]);
        Z.insert(s[i]+t[i]);
    }
    ll x[q],y[q],z[q];
    vector<ll>ans(q,0);
    for(ll i=0;i<q;i++){
        cin>>x[i]>>y[i]>>z[i];
        S.insert(x[i]);
        T.insert(y[i]);
        Z.insert(z[i]);
    }
    ll Sc=S.size(),Tc=T.size(),Zc=Z.size();
    ll Sa[Sc],Ta[Tc],Za[Zc],cur=0;
    for(auto x:S){
        Sa[cur++]=x;
    }
    cur=0;
    for(auto x:T){
        Ta[cur++]=x;
    }
    cur=0;
    for(auto x:Z){
        Za[cur++]=x;
    }
    //case1 x[i]+y[i]>=z[i]
    vector<ll>upd[N+5];
    vector<pair<ll,ll>>ask[N+5];
    for(ll i=0;i<n;i++){
        ll p=lower_bound(Sa,Sa+Sc,s[i])-Sa;
        ll q=lower_bound(Ta,Ta+Tc,t[i])-Ta;
        upd[p].pb(q);
    }
    for(ll i=0;i<q;i++){
        if(x[i]+y[i]>=z[i]){
            ll p=lower_bound(Sa,Sa+Sc,x[i])-Sa;
            ll q=lower_bound(Ta,Ta+Tc,y[i])-Ta;
            ask[p].pb({q,i});
        }
    }
    segtree sg(N);
    for(ll i=N;i>=0;i--){
        for(auto y:upd[i]){
            sg.update(1,0,N,y,1);
        }
        for(auto [y,j]:ask[i]){
            ans[j]=sg.query(1,0,N,y,N);
        }
    }
    for(ll i=0;i<=N;i++){
        sg.set(1,0,N,i,0);
        upd[i].clear();
    }
    for(ll i=0;i<n;i++){
        ll p=lower_bound(Za,Za+Zc,s[i]+t[i])-Za;
        upd[p].pb(i);
    }
    vector<ll>que[N+5];
    for(ll i=0;i<q;i++){
        if(x[i]+y[i]<z[i]){
            ll p=lower_bound(Za,Za+Zc,z[i])-Za;
            que[p].pb(i);
        }
    }
    for(ll i=N;i>=0;i--){
        for(auto j:upd[i]){
            ll p=lower_bound(Sa,Sa+Sc,s[j])-Sa;
            sg.update(1,0,N,p,1);
        }
        for(auto j:que[i]){
            ll p=lower_bound(Sa,Sa+Sc,x[j])-Sa;
            ans[j]=sg.query(1,0,N,p,N);
        }
    }
    for(ll i=0;i<=N;i++){
        sg.set(1,0,N,i,0);
    }
    for(ll i=N;i>=0;i--){
        for(auto j:upd[i]){
            ll p=lower_bound(Ta,Ta+Tc,t[j])-Ta;
            sg.update(1,0,N,p,1);
        }
        for(auto j:que[i]){
            ll p=lower_bound(Ta,Ta+Tc,y[j])-Ta;
            ans[j]-=sg.query(1,0,N,0,p-1);
        }
    }
    for(ll i=0;i<q;i++){
        cout<<ans[i]<<"\n";
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 20684 KB Output is correct
2 Correct 48 ms 20568 KB Output is correct
3 Correct 45 ms 20824 KB Output is correct
4 Correct 48 ms 20824 KB Output is correct
5 Correct 46 ms 20568 KB Output is correct
6 Correct 45 ms 20572 KB Output is correct
7 Correct 54 ms 22104 KB Output is correct
8 Correct 55 ms 22108 KB Output is correct
9 Correct 56 ms 22228 KB Output is correct
10 Correct 54 ms 21848 KB Output is correct
11 Correct 54 ms 21848 KB Output is correct
12 Correct 51 ms 21084 KB Output is correct
13 Correct 55 ms 21896 KB Output is correct
14 Correct 56 ms 21916 KB Output is correct
15 Correct 53 ms 22076 KB Output is correct
16 Correct 51 ms 21684 KB Output is correct
17 Correct 54 ms 21852 KB Output is correct
18 Correct 48 ms 21336 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 436 ms 47476 KB Output is correct
2 Correct 440 ms 47484 KB Output is correct
3 Correct 407 ms 47596 KB Output is correct
4 Correct 294 ms 41428 KB Output is correct
5 Correct 263 ms 41100 KB Output is correct
6 Correct 121 ms 30512 KB Output is correct
7 Correct 389 ms 45904 KB Output is correct
8 Correct 368 ms 46312 KB Output is correct
9 Correct 349 ms 44500 KB Output is correct
10 Correct 241 ms 40232 KB Output is correct
11 Correct 243 ms 41256 KB Output is correct
12 Correct 104 ms 29644 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 436 ms 47476 KB Output is correct
2 Correct 440 ms 47484 KB Output is correct
3 Correct 407 ms 47596 KB Output is correct
4 Correct 294 ms 41428 KB Output is correct
5 Correct 263 ms 41100 KB Output is correct
6 Correct 121 ms 30512 KB Output is correct
7 Correct 389 ms 45904 KB Output is correct
8 Correct 368 ms 46312 KB Output is correct
9 Correct 349 ms 44500 KB Output is correct
10 Correct 241 ms 40232 KB Output is correct
11 Correct 243 ms 41256 KB Output is correct
12 Correct 104 ms 29644 KB Output is correct
13 Correct 465 ms 51116 KB Output is correct
14 Correct 462 ms 50592 KB Output is correct
15 Correct 444 ms 47544 KB Output is correct
16 Correct 304 ms 42960 KB Output is correct
17 Correct 330 ms 43024 KB Output is correct
18 Correct 122 ms 30136 KB Output is correct
19 Correct 469 ms 50940 KB Output is correct
20 Correct 441 ms 50800 KB Output is correct
21 Correct 458 ms 50228 KB Output is correct
22 Correct 231 ms 40236 KB Output is correct
23 Correct 270 ms 41240 KB Output is correct
24 Correct 105 ms 29668 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 20684 KB Output is correct
2 Correct 48 ms 20568 KB Output is correct
3 Correct 45 ms 20824 KB Output is correct
4 Correct 48 ms 20824 KB Output is correct
5 Correct 46 ms 20568 KB Output is correct
6 Correct 45 ms 20572 KB Output is correct
7 Correct 54 ms 22104 KB Output is correct
8 Correct 55 ms 22108 KB Output is correct
9 Correct 56 ms 22228 KB Output is correct
10 Correct 54 ms 21848 KB Output is correct
11 Correct 54 ms 21848 KB Output is correct
12 Correct 51 ms 21084 KB Output is correct
13 Correct 55 ms 21896 KB Output is correct
14 Correct 56 ms 21916 KB Output is correct
15 Correct 53 ms 22076 KB Output is correct
16 Correct 51 ms 21684 KB Output is correct
17 Correct 54 ms 21852 KB Output is correct
18 Correct 48 ms 21336 KB Output is correct
19 Correct 436 ms 47476 KB Output is correct
20 Correct 440 ms 47484 KB Output is correct
21 Correct 407 ms 47596 KB Output is correct
22 Correct 294 ms 41428 KB Output is correct
23 Correct 263 ms 41100 KB Output is correct
24 Correct 121 ms 30512 KB Output is correct
25 Correct 389 ms 45904 KB Output is correct
26 Correct 368 ms 46312 KB Output is correct
27 Correct 349 ms 44500 KB Output is correct
28 Correct 241 ms 40232 KB Output is correct
29 Correct 243 ms 41256 KB Output is correct
30 Correct 104 ms 29644 KB Output is correct
31 Correct 465 ms 51116 KB Output is correct
32 Correct 462 ms 50592 KB Output is correct
33 Correct 444 ms 47544 KB Output is correct
34 Correct 304 ms 42960 KB Output is correct
35 Correct 330 ms 43024 KB Output is correct
36 Correct 122 ms 30136 KB Output is correct
37 Correct 469 ms 50940 KB Output is correct
38 Correct 441 ms 50800 KB Output is correct
39 Correct 458 ms 50228 KB Output is correct
40 Correct 231 ms 40236 KB Output is correct
41 Correct 270 ms 41240 KB Output is correct
42 Correct 105 ms 29668 KB Output is correct
43 Correct 822 ms 71524 KB Output is correct
44 Correct 751 ms 71456 KB Output is correct
45 Correct 797 ms 71536 KB Output is correct
46 Correct 450 ms 58996 KB Output is correct
47 Correct 460 ms 57944 KB Output is correct
48 Correct 140 ms 29512 KB Output is correct
49 Correct 823 ms 70756 KB Output is correct
50 Correct 920 ms 71496 KB Output is correct
51 Correct 831 ms 70712 KB Output is correct
52 Correct 493 ms 57360 KB Output is correct
53 Correct 374 ms 52548 KB Output is correct