soj#2402 「THUPC 2017」天天爱射击 / Shooting

分析

按照被穿过多少次整体二分即可

代码

#include<bits/stdc++.h>
using namespace std;
#define lb(x) x&(-x)
int n,m,le[],ri[],s[],pl[],N;
int id[],ans[],c1[],c2[],d[];
inline void add(int x,int k){while(x<=N)d[x]+=k,x+=lb(x);}
inline int que(int x){int res=;while(x)res+=d[x],x-=lb(x);return res;}
inline void work(int l,int r,int x,int y){
    if(l>r||x>y)return;
    if(l==r){ans[l]=y-x+;return;}
    int i,j,k,mid=(l+r)>>,cnt1=,cnt2=;
    for(i=l;i<=mid;i++)add(pl[i],);
    for(i=x;i<=y;i++){
      int wh=id[i],k=que(ri[wh])-que(le[wh]-);
      if(k>=s[wh])c1[++cnt1]=wh;
        else s[wh]-=k,c2[++cnt2]=wh;
    }
    for(i=;i<=cnt1;i++)id[x+i-]=c1[i];
    for(i=;i<=cnt2;i++)id[x+cnt1+i-]=c2[i];
    for(i=l;i<=mid;i++)add(pl[i],-);
    work(l,mid,x,x+cnt1-),work(mid+,r,x+cnt1,y);
}
int main(){
    int i,j,k;
    scanf("%d%d",&n,&m);
    for(i=;i<=n;i++)scanf("%d%d%d",&le[i],&ri[i],&s[i]),N=max(N,ri[i]);
    for(i=;i<=m;i++)scanf("%d",&pl[i]);
    for(i=;i<=n;i++)id[i]=i;
    work(,m+,,n);
    for(i=;i<=m;i++)printf("%d\n",ans[i]);
    return ;
}