oj.uz

Submission #715230

# Submission time Handle Problem Language Result Execution time Memory
715230 2023-03-26T08:44:12 Z Khizri Examination (JOI19_examination) C++17
0 / 100
 91 ms 4860 KB 
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5,N=1e5;
int t=1,n,m,tree[4*mxn],ans[mxn],x[mxn],y[mxn];
void update(int node,int l,int r,int ind,int val){
    if(ind<l||ind>r) return;
    if(l==r){
        tree[node]+=val;
        return;
    }
    int m=(l+r)/2;
    update(2*node,l,m,ind,val);
    update(2*node+1,m+1,r,ind,val);
    tree[node]=tree[2*node]+tree[2*node+1];
}
int query(int node,int l,int r,int ql,int qr){
    if(l>qr||r<ql) return 0;
    if(ql<=l&&r<=qr){
        return tree[node];
    }
    int m=(l+r)/2;
    int x=query(2*node,l,m,ql,qr);
    int y=query(2*node+1,m+1,r,ql,qr);
    return x+y;
}
bool f(int a,int b){
    return x[a]<x[b];
}
bool ff(pair<pii,int>a,pair<pii,int>b){
    return a.F.F>b.F.F;
}
void solve(){
    vector<pii>vt;
    vector<int>q;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        vt.pb({a,b});
    }
    for(int i=1;i<=m;i++){
        int c;
        cin>>x[i]>>y[i]>>c;
        q.pb(i);

    }
    sort(all(vt));
    sort(all(q),f);
    int idx=vt.size()-1;
    for(int i=q.size()-1;i>=0;i--){
        int a=x[q[i]],b=y[q[i]];
        while(idx>=0&&vt[idx].F>=a){
            update(1,1,100000,vt[idx].S,1);
            idx--;
        }
        ans[q[i]]=query(1,1,100000,b,N);
    }
    for(int i=1;i<=m;i++){
        cout<<ans[i]<<endl;
    }
}
int main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 4860 KB Output is correct
2 Correct 91 ms 4744 KB Output is correct
3 Correct 87 ms 4680 KB Output is correct
4 Incorrect 81 ms 3712 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 4860 KB Output is correct
2 Correct 91 ms 4744 KB Output is correct
3 Correct 87 ms 4680 KB Output is correct
4 Incorrect 81 ms 3712 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -