제출 #945418

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945418		JakobZorz	Examination (JOI19_examination)	C++17	100 / 100	1014 ms	606512 KiB

examination

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;

struct Obj{
    ll a,b,c;
    int res;
    bool is_q;
};

bool cmp1(Obj*a,Obj*b){
    return a->c<b->c;
}

bool cmp2(Obj*a,Obj*b){
    return a->b<b->b;
}

const int TREE_SIZE=1<<30;

struct SegTree{
    SegTree*ch1,*ch2;
    int val;
    SegTree():ch1(nullptr),ch2(nullptr),val(0){}
};

void add(SegTree*node,int rl,int rr,int i){
    node->val++;
    if(rl==rr-1)
        return;
    
    int mid=(rl+rr)/2;
    if(i<mid){
        if(node->ch1==nullptr)
            node->ch1=new SegTree;
        add(node->ch1,rl,mid,i);
    }else{
        if(node->ch2==nullptr)
            node->ch2=new SegTree;
        add(node->ch2,mid,rr,i);
    }
}

int get(SegTree*node,int rl,int rr,int l,int r){
    if(r<=rl||rr<=l)
        return 0;
    if(l<=rl&&rr<=r)
        return node->val;
    int res=0;
    int mid=(rl+rr)/2;
    if(node->ch1)
        res+=get(node->ch1,rl,mid,l,r);
    if(node->ch2)
        res+=get(node->ch2,mid,rr,l,r);
    return res;
}

void proc(vector<Obj*>vals,vector<Obj*>qrs){
    sort(vals.begin(),vals.end(),cmp2);
    reverse(vals.begin(),vals.end());
    sort(qrs.begin(),qrs.end(),cmp2);
    reverse(qrs.begin(),qrs.end());
    int i=0;
    SegTree tree;
    for(auto qr:qrs){
        while(i<(int)vals.size()&&vals[i]->b>=qr->b){
            add(&tree,0,TREE_SIZE,(int)vals[i]->a);
            i++;
        }
        qr->res+=get(&tree,0,TREE_SIZE,(int)qr->a,TREE_SIZE);
    }
}

void dc(vector<Obj*>arr){
    int n=(int)arr.size();
    if(arr[0]->c==arr.back()->c){
        vector<Obj*>qrs,vals;
        for(int i=0;i<n;i++){
            if(arr[i]->is_q)
                qrs.push_back(arr[i]);
            else
                vals.push_back(arr[i]);
        }
        proc(vals,qrs);
        return;
    }
    int mid=0;
    for(int i=0;i<n/2||mid==0;i++)
        if(arr[i]->c!=arr[i+1]->c)
            mid=i+1;
    vector<Obj*>qrs,vals;
    vector<Obj*>arr1,arr2;
    for(int i=mid;i<n;i++){
        arr2.push_back(arr[i]);
        if(!arr[i]->is_q)
            vals.push_back(arr[i]);
    }
    for(int i=0;i<mid;i++){
        arr1.push_back(arr[i]);
        if(arr[i]->is_q)
            qrs.push_back(arr[i]);
    }
    proc(vals,qrs);
    dc(arr1);
    dc(arr2);
}

void solve(){
    int n,q;
    cin>>n>>q;
    vector<Obj>arr(n);
    for(Obj&i:arr){
        cin>>i.a>>i.b;
        i.c=i.a+i.b;
        i.is_q=false;
        i.res=0;
    }
    vector<Obj>qrs(q);
    for(Obj&i:qrs){
        cin>>i.a>>i.b>>i.c;
        i.is_q=true;
        i.res=0;
    }
    vector<Obj*>all;
    for(Obj&i:arr)
        all.push_back(&i);
    for(Obj&i:qrs)
        all.push_back(&i);
    sort(all.begin(),all.end(),cmp1);
    dc(all);
    for(auto i:qrs)
        cout<<i.res<<"\n";
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("/Users/jakob/cp_testing/test.txt","r",stdin);//freopen("output.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}


/*

5 4
35 100
70 70
45 15
80 40
20 95
20 50 120
10 10 100
60 60 80
0 100 100
 
 */

• Subtask 1: 2 / 2
• Subtask 2: 20 / 20
• Subtask 3: 21 / 21
• Subtask 4: 57 / 57