Submission #76650192

---

Source Code Expand

#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#define rep(i,l,r) for(int i=l;i<=r;i++)
constexpr int N=300005;
int rd(){
    int x=0,f=1;
    char c=getchar();
    for(;!isdigit(c);c=getchar())f=c==45?-1:f;
    for(;isdigit(c);c=getchar())x=x*10+c-48;
    return x*f;
}
using namespace std;
int n;
int t[N<<1];
void upd(int x,int c){
    while(x<=n)t[x]+=c,x+=x&-x;
}
int que(int x){
    int ret=0;
    while(x)ret+=t[x],x-=x&-x;
    return ret;
}
int cnt;
vector<int>cue[N];
signed main(){
    n=rd();
    rep(i,1,n){
        int x=rd(),y=rd();
        cue[x].emplace_back(y);
    }
    rep(x,1,n){
        for(int y:cue[x])if(que(y-1)==0)cnt++;
        for(int y:cue[x])upd(y,1);
    }
    cout<<cnt;
    return 0;
}

Submission Info

Judge Result