noip模拟76[失落]

#include<bits/stdc++.h>
using namespace std;
#define oj
#define int long long
#define fo(i,x,y) for(int i=(x);i<=(y);i++)
#define fu(i,x,y) for(int i=(x);i>=(y);i--)
const int N=2005;
const int Q=5e5+5;
const int mod=1e9+7;
int T,n,m,q;
struct ma{
    int r1,r2,c1,c2;
    ma(){}
}sca[Q],use[Q];
int buc[Q];
struct node{
    int ans,sum;
    node(){}
    node(int x,int y){ans=x;sum=y;}
    node operator + (node x)const{
        node ret;
        if(ans>x.ans)ret=*this;
        if(ans<x.ans)ret=x;
        if(ans==x.ans)ret.ans=ans,ret.sum=(sum+x.sum)%mod;
        return ret;
    }
    bool operator < (node x)const{
        return ans<x.ans;
    }
}dp[N][N],ans;
void print(node x){printf("%lld %lld\n",x.ans,x.sum);}
int le[N][N],ri[N][N],up[N][N],dw[N][N];
int getri(int x,int y){return ri[x][y]==0?x:ri[x][y]=getri(ri[x][y],y);}
int getup(int x,int y){return up[x][y]==0?y:up[x][y]=getup(x,up[x][y]);}
struct Queue{
    node q[N];
    int w[N],cnt[N];
    int bot,top;
    void init(){
        bot=1;top=0;
        fo(i,0,min(n,m))cnt[i]=0;
    }
    void push(int x,node v){
        while(bot<=top&&q[top]<v)cnt[q[top].ans]=(cnt[q[top].ans]-q[top].sum+mod)%mod,top--;
        q[++top]=v;cnt[q[top].ans]=(cnt[q[top].ans]+q[top].sum)%mod;w[top]=x;
    }
    node query(int x){
        while(bot<=top&&w[bot]<x)cnt[q[bot].ans]=(cnt[q[bot].ans]-q[bot].sum+mod)%mod,bot++;
        return node(q[bot].ans+1,cnt[q[bot].ans]);
    }
}r[N],c[N];
signed main(){
    #ifdef oj
        freopen("roche.in","r",stdin);
        freopen("roche.out","w",stdout);
    #endif
    scanf("%lld",&T);
    while(T--){
        scanf("%lld%lld%lld",&n,&m,&q);
        fo(i,1,n)fo(j,1,m)up[i][j]=le[i][j]=dw[i][j]=ri[i][j]=0;
        fo(i,1,q)scanf("%lld%lld%lld%lld",&sca[i].r1,&sca[i].c1,&sca[i].r2,&sca[i].c2);
        fo(i,1,q)buc[sca[i].r1]++;
        fo(i,1,n)buc[i]+=buc[i-1];
        fo(i,1,q)use[buc[sca[i].r1]--]=sca[i];
        fo(i,1,n)buc[i]=0;
        fo(i,1,q){
            fo(y,use[i].c1+1,use[i].c2){
                for(int x=use[i].r1+1;x<=use[i].r2;){
                    if(!ri[x][y]){
                        le[x][y]=use[i].r1;
                        ri[x][y]=x+1;
                        x++;
                    }
                    else x=getri(x,y);
                }
            }
        }
        //cout<<"fuck"<<endl;
        ans=node(0,0);
        fo(i,1,q)buc[sca[i].c1]++;
        fo(i,1,m)buc[i]+=buc[i-1];
        fo(i,1,q)use[buc[sca[i].c1]--]=sca[i];
        fo(i,1,m)buc[i]=0;
        fo(i,1,q){
            fo(x,use[i].r1+1,use[i].r2){
                for(int y=use[i].c1+1;y<=use[i].c2;){
                    if(!up[x][y]){
                        dw[x][y]=use[i].c1;
                        up[x][y]=y+1;
                        y++;
                    }
                    else y=getup(x,y);
                }
            }
        }
        //cout<<"SB"<<endl;
        fo(i,1,n)fo(j,1,m)dp[i][j]=node(1,1);
        fo(i,1,n)r[i].init();
        fo(i,1,m)c[i].init();
        fo(i,1,n){
            fo(j,1,m){
                r[i].push(j,dp[i][j]);
                c[j].push(i,dp[i][j]);
                if(i<n&&j<m&&le[i+1][j+1]&&dw[i+1][j+1]){
                    dp[i+1][j+1]=dp[i+1][j+1]+r[i].query(dw[i+1][j+1]);
                    dp[i+1][j+1]=dp[i+1][j+1]+c[j].query(le[i+1][j+1]);
                    if(dp[i][j].ans+1==dp[i+1][j+1].ans)dp[i+1][j+1].sum=(dp[i+1][j+1].sum-dp[i][j].sum+mod)%mod;
                }
                //cout<<i<<" "<<j<<" ";print(dp[i][j]);
                ans=ans+dp[i][j];
            }
        }
        print(ans);
    }
}