Codeforces 12D Ball

N ladies attend the ball in the King's palace. Every lady can be described with three values: beauty, intellect and richness. King's Master of Ceremonies knows that ladies are very special creatures. If some lady understands that there is other lady at the ball which is more beautiful, smarter and more rich, she can jump out of the window. He knows values of all ladies and wants to find out how many probable self-murderers will be on the ball. Lets denote beauty of the i-th lady by B_i, her intellect by I_i and her richness by R_i. Then i-th lady is a probable self-murderer if there is some j-th lady that B_i < B_j, I_i < I_j, R_i < R_j. Find the number of probable self-murderers.

Input

The first line contains one integer N (1 ≤ N ≤ 500000). The second line contains N integer numbers B_i, separated by single spaces. The third and the fourth lines contain sequences I_i and R_i in the same format. It is guaranteed that 0 ≤ B_i, I_i, R_i ≤ 10⁹.

Output

Output the answer to the problem.

Sample test(s)

input

3 1 4 2 4 3 2 2 5 3

output

1

#include <cstdio>
#include <algorithm>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define maxn 500005
struct node
{
    int s;
}setree[maxn<<2];
struct op{
    int a,b,c;
}mes[maxn];
int sorted[maxn];
struct{
    int num,c;
}mess[maxn];
int binsearch(int l,int r,int key)
{
    int m=(l+r)>>1;
    if(sorted[m]==key)
    return m;
    if(key<sorted[m])
    return binsearch(l,m-1,key);
    return binsearch(m+1,r,key);
}
void build(int l,int r,int rt)
{
    setree[rt].s=0;

    if(l==r)
    return ;
    int m=(l+r)>>1;
    build(lson);
    build(rson);
}
void pushup(int rt)
{
    setree[rt].s=max(setree[rt<<1].s,setree[rt<<1|1].s);
}
void update(int l,int r,int rt,int num,int c)
{
    if(l==r){
        if(setree[rt].s<c)
        setree[rt].s=c;
        return;
    }
    int m=(l+r)>>1;
    if(num<=m)
    update(lson,num,c);
    else
    update(rson,num,c);
    pushup(rt);
}
int query(int l,int r,int rt,int L,int R)
{
    if(L<=l&&r<=R)
        return setree[rt].s;
    int m=(l+r)>>1;
    int ans=0;
    if(L<=m)
    ans=max(query(lson,L,R),ans);
    if(R>m)
    ans=max(ans,query(rson,L,R));
    return ans;
}
bool cmp(struct op x1,struct op x2)
{
    return x1.a>x2.a;
}
void updateing(int k,int n)
{
    for(int i=0;i<=k;i++)
    update(0,n-1,1,mess[i].num,mess[i].c);
}
int main()
{
    int n;
    while(~scanf("%d",&n)){
        
        for(int i=0;i<n;i++)
            scanf("%d",&mes[i].a);
        for(int i=0;i<n;i++){
            scanf("%d",&mes[i].b);
            sorted[i]=mes[i].b;
        }
        for(int i=0;i<n;i++)
            scanf("%d",&mes[i].c);
            
        sort(mes,mes+n,cmp);
        sort(sorted,sorted+n);
        
        int k=1,ans=0;
        for(int i=1;i<n;i++)
        if(sorted[i]!=sorted[i-1])
        sorted[k++]=sorted[i];
        
        build(0,k-1,1);
        int num=binsearch(0,k-1,mes[0].b);
        int cnt=0;
        mess[0].num=num;
        mess[0].c=mes[0].c;
        for(int i=1;i<n;i++){
            num=binsearch(0,k-1,mes[i].b);
            if(mes[i].a!=mes[i-1].a){
            updateing(cnt,k);
            cnt=0;
            mess[cnt].num=num;
            mess[cnt].c=mes[i].c;
            }
            else{
                mess[++cnt].num=num;
                mess[cnt].c=mes[i].c;
            }
            if(num<=k-2&&mes[i].c<query(0,k-1,1,num+1,k-1))
            ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}