Monitor

http://acm.hdu.edu.cn/showproblem.php?pid=6514 

题意：给p个监视器，每个监视一个矩形；q个询问是否询问的矩形全部包含在监视器内；

思路：二维差分；数组太大压缩成一维； 将监视范围赋值1，查询询问区域是否和一样；

反思：差分（get），边界一定要注意选先处理，不然会影响！！！

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e7+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

int n,m;
int a[maxn];
int ID(int x,int y)
{
    return (x-1)*m+y;
}
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);
    while(cin>>n>>m)
    {
        mem(a);
        int p;
        cin>>p;
        while(p--)
        {
            int x1,y1,x2,y2;
            cin>>x1>>y1>>x2>>y2;
            a[ID(x1,y1)]++;
            if(x2+1<=n)
                a[ID(x2+1,y1)]--;
            if(y2+1<=m)
                a[ID(x1,y2+1)]--;
            if(x2+1<=n&&y2+1<=m)
                a[ID(x2+1,y2+1)]++;
        }

        for(int i=2;i<=n;i++) a[ID(i,1)]+=a[ID(i-1,1)];
        for(int j=2;j<=m;j++) a[ID(1,j)]+=a[ID(1,j-1)];
        for(int i=2;i<=n;i++)
        {
            for(int j=2;j<=m;j++)
            {
                a[ID(i,j)]=a[ID(i,j)]+a[ID(i-1,j)]+a[ID(i,j-1)]-a[ID(i-1,j-1)];
                //cout<<a[ID(i,j)]<<" ";
                //printf("(%d,%d,%d) ",i,j,ID(i,j));
            }
            //cout<<endl;
        }

        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                a[ID(i,j)]=min(a[ID(i,j)],1);
            }
        }

        for(int i=2;i<=n;i++) a[ID(i,1)]+=a[ID(i-1,1)];
        for(int j=2;j<=m;j++) a[ID(1,j)]+=a[ID(1,j-1)];
        for(int i=2;i<=n;i++)
        {
            for(int j=2;j<=m;j++)
            {
                a[ID(i,j)]=a[ID(i,j)]+a[ID(i-1,j)]+a[ID(i,j-1)]-a[ID(i-1,j-1)];
            }
        }
        /*for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                cout<<a[ID(i,j)];
            }
            cout<<endl;
        }*/
        int q;
        cin>>q;
        while(q--)
        {
            int x1,y1,x2,y2;
            cin>>x1>>y1>>x2>>y2;

            ll k=1LL*a[ID(x2,y1-1)];
            if(y1-1<1) k=0;
            ll kk=1LL*a[ID(x1-1,y2)];
            if(x1-1<1) kk=0;
            ll kkk=1LL*a[ID(x1-1,y1-1)];
            if(x1-1<1||y1-1<1) kkk=0;
            ll sum=1LL*a[ID(x2,y2)]-k-kk+kkk;
            //cout<<sum<<endl;
            if(sum==1LL*(1LL*x2-x1+1)*1LL*(1LL*y2-y1+1)) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}