UOJ#495晒被子

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<cmath>
 #include<algorithm>
 #include<ctime>
 #include<deque>
 using namespace std;
 const long long N=;
 long long n,m,x1,y11,x2,y2,t;
 struct tree{
     long long l,r,a,b,c;
 }tree[*N];
 void build(long long o,long long l,long long r){
     tree[o].a=tree[o].b=tree[o].c=;
     tree[o].l=l;
     tree[o].r=r;
     if(l==r){
         return;
     }
     long long mid=(l+r)/;
     build(o*,l,mid);
     build(o*+,mid+,r);
 }
 void pushdown(long long o){
     tree[o*].a+=tree[o].a;
     tree[o*].b+=tree[o].b;
     tree[o*].c+=tree[o].c;
     tree[o*+].a+=tree[o].a;
     tree[o*+].b+=tree[o].b;
     tree[o*+].c+=tree[o].c;
     tree[o].a=tree[o].b=tree[o].c=;
 }
 long long query(long long o,long long k){
     long long l=tree[o].l,r=tree[o].r;
     if(l==r){
         return k*k*tree[o].a+k*tree[o].b+tree[o].c;
     }
     long long mid=(l+r)/;
     pushdown(o);
     if(k<=mid){
         return query(o*,k);
     }
     else{
         return query(o*+,k);
     }
 }
 void update(long long o,long long ql,long long qr,long long a,long long b,long long c){
     long long l=tree[o].l,r=tree[o].r;
     if(ql<=l&&r<=qr){
         tree[o].a+=a;
         tree[o].b+=b;
         tree[o].c+=c;
         return;
     }
     long long mid=(l+r)/;
     if(ql<=mid){
         update(o*,ql,qr,a,b,c);
     }
     if(qr>mid){
         update(o*+,ql,qr,a,b,c);
     }
 }
 int main(){
     scanf("%lld%lld",&n,&m);
     build(,,);
     for(long long i=;i<=n;i++){
         scanf("%lld%lld%lld%lld",&x1,&y11,&x2,&y2);
         update(,max(x2,y2)+,,,,(x2-x1)*(y2-y11));
         if(x2<y2){
             update(,max(x2,y11)+,y2,,x2-x1,y11*(x1-x2));
         }
         else{
             update(,max(x1,y2)+,x2,,y2-y11,x1*(y11-y2));
         }
         if(max(x1,y11)<min(x2,y2)){
             update(,max(x1,y11),min(x2,y2),,-(x1+y11),x1*y11);
         }
     }
     for(long long i=;i<=m;i++){
         scanf("%lld",&t);
         printf("%lld\n",query(,t));
     }
     return ;
 }