bzoj5132 [CodePlus2017年12月]火锅盛宴（线段树+stl）

stl+线段树硬刚，我也是无话可说。orz leoly

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define pa pair<int,int>
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,t[N],pos[N],sum[N<<2];
deque<int>q[N];
inline void build(int p,int l,int r){
    sum[p]=0;if(l==r){pos[l]=p;return;}int mid=l+r>>1;
    build(p<<1,l,mid);build(p<<1|1,mid+1,r);
}
inline void add(int p,int l,int r,int x){
    sum[p]++;if(l==r) return;int mid=l+r>>1;
    if(x<=mid) add(p<<1,l,mid,x);
    else add(p<<1|1,mid+1,r,x);
}
inline int askl(int p,int l,int r){
    sum[p]--;if(l==r) return l;int mid=l+r>>1;
    if(sum[p<<1]) return askl(p<<1,l,mid);
    return askl(p<<1|1,mid+1,r);
}
inline bool check(int id){
    int p=pos[id];
    if(!sum[p]) return 0;
    while(p) sum[p]--,p>>=1;return 1;
}
inline int qsum(int p,int l,int r,int x,int y){
    if(x<=l&&r<=y) return sum[p];
    int mid=l+r>>1,res=0;
    if(x<=mid) res+=qsum(p<<1,l,mid,x,y);
    if(y>mid) res+=qsum(p<<1|1,mid+1,r,x,y);
    return res;
}
int main(){
//  freopen("a.in","r",stdin);
    int tst=read();
    while(tst--){
        n=read();for(int i=1;i<=n;++i) t[i]=read();
        build(1,1,n);for(int i=1;i<=n;++i) q[i].clear();
        int m=read();priority_queue<pa,vector<pa>,greater<pa> >qt;
        while(m--){
            int T=read(),op=read();
            while(!qt.empty()&&qt.top().first<=T){
                int id=qt.top().second;qt.pop();
                add(1,1,n,id);q[id].pop_front();
            }if(!op){
                int id=read();qt.push(make_pair(T+t[id],id));
                q[id].push_back(T+t[id]);continue;
            }if(op==1){
                if(!sum[1]) puts("Yazid is angry.");
                else printf("%d\n",askl(1,1,n));
            }if(op==2){
                int id=read();
                if(check(id)) puts("Succeeded!");
                else if(q[id].empty()) puts("YJQQQAQ is angry.");
                else printf("%d\n",q[id].front()-T);
            }if(op==3){
                int l=read(),r=read();
                printf("%d\n",qsum(1,1,n,l,r));
            }
        }
    }return 0;
}