14991： [Usaco2017 Feb]Why Did the Cow Cross the Road III

☈弑.

于 2024-09-27 19:12:19 发布

阅读量38

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/HRC122449/article/details/142600613

版权

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,K,b[N],c[N];ll ans=0;
struct Ev{
    int x,y;
    friend bool operator<(Ev a,Ev b){return a.x>=b.x;}
}e[N],tmp[N];
inline void add(int x,int val){for(;x<=n;x+=x&-x) c[x]+=val;}
inline int ask(int x){if(x<=0) return 0;int res=0;for(;x;x-=x&-x) res+=c[x];return res;}
inline void cdq(int l,int r){
    if(l==r) return;int mid=l+r>>1;
    cdq(l,mid);cdq(mid+1,r);
    int p1=l,p2=mid+1,owo=l,tot=0;
    while(p1<=mid&&p2<=r){
        if(e[p1]<e[p2]) add(e[p1].y,1),tmp[owo++]=e[p1++],++tot;
        else ans+=(e[p2].y+K<n?tot-ask(e[p2].y+K):0)+ask(e[p2].y-K-1),tmp[owo++]=e[p2++];
    }while(p2<=r) ans+=(e[p2].y+K<n?tot-ask(e[p2].y+K):0)+ask(e[p2].y-K-1),tmp[owo++]=e[p2++];
    for(int i=l;i<p1;++i) add(e[i].y,-1);
    while(p1<=mid) tmp[owo++]=e[p1++],++tot;
    memcpy(e+l,tmp+l,sizeof(e[0])*(r-l+1));
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();K=read();
    for(int i=1;i<=n;++i) b[read()]=i;
    for(int i=1;i<=n;++i) e[i].y=read();
    for(int i=1;i<=n;++i) e[i].x=b[e[i].y];cdq(1,n);
    printf("%lld\n",ans);
    return 0;
}