[CF877F]Ann and Books

题目大意：
　　有$n(n\le10^5)$个数$w_{1\sim n}(|w_i|\le10^9)$，并给定一个数$k(|k|\le10^9)$。$q(q\le10^5)$次询问，每次询问区间$[l,r]$中满足数字之和等于$k$的子区间数。

思路：
　　莫队卡常。

 #pragma GCC optimize("Ofast")
 #pragma GCC optimize("unroll-loops")
 #include<cmath>
 #include<cstdio>
 #include<cctype>
 #include<algorithm>
 #include<unordered_map>
 #include<tr1/unordered_map>
 using int64=long long;
 inline int getint() {
     register char ch;
     register bool neg=false;
     while(!isdigit(ch=getchar())) neg|=ch=='-';
     register int x=ch^'';
     while(isdigit(ch=getchar())) x=(((x<<)+x)<<)+(ch^'');
     return neg?-x:x;
 }
 constexpr int N=1e5+,M=1e5;
 int k,block;
 int64 a[N],ans[N],tmp;
 struct Query {
     int l,r,id;
     bool operator < (const Query &another) const {
         return l/block==another.l/block?r<another.r:l/block<another.l/block;
     }
 };
 Query q[M];
 std::tr1::unordered_map<int64,int> map;
 inline void ins(const int64 &x,const bool &b) {
     tmp+=map[x-k*(b?:-)];
     map[x]++;
 }
 inline void del(const int64 &x,const bool &b) {
     map[x]--;
     tmp-=map[x-k*(b?:-)];
 }
 int main() {
     const int n=getint();
     block=sqrt(n)*,k=getint();
     for(register int i=;i<=n;i++) {
         a[i]=getint()==?:-;
     }
     for(register int i=;i<=n;i++) {
         (a[i]*=getint())+=a[i-];
     }
     const int m=getint();
     for(register int i=;i<m;i++) {
         const int l=getint()-,r=getint();
         q[i]={l,r,i};
     }
     std::sort(&q[],&q[m]);
     for(register int i=,l=,r=-;i<m;i++) {
         while(l>q[i].l) ins(a[--l],);
         while(r<q[i].r) ins(a[++r],);
         while(l<q[i].l) del(a[l++],);
         while(r>q[i].r) del(a[r--],);
         ans[q[i].id]=tmp;
     }
     for(register int i=;i<m;i++) {
         printf("%I64d%c",ans[i]," \n"[i==m-]);
     }
     return ;
 }