ARC032 D - アットコーダーモンスターズ

#include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^‘0‘)
#define pb push_back
#define solid const auto &
#define enter cout<<endl
#define pii pair<int,int>
using namespace std;
typedef long long ll;
template<class T>il void rd(T &x){
    char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch==‘-‘)&&(fl=true);
    for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);}
template<class T>il void output(T x){if(x/10)output(x/10);putchar(x%10+‘0‘);}
template<class T>il void ot(T x){if(x<0) putchar(‘-‘),x=-x;output(x);putchar(‘ ‘);}
template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar(‘\n‘);}
namespace Modulo{
const int mod=1e9+7;
il int ad(int x,int y){return x+y>=mod?x+y-mod:x+y;}
il int sub(int x,int y){return ad(x,mod-y);}
il int mul(int x,int y){return (ll)x*y%mod;}
il void inc(int &x,int y){x=ad(x,y);}
il void inc2(int &x,int y){x=mul(x,y);}
il int qm(int x,int y=mod-2){int ret=1;while(y){if(y&1) ret=mul(x,ret);x=mul(x,x);y>>=1;}return ret;}
template<class ...Args>il int ad(const int a,const int b,const Args &...args) {return ad(ad(a,b),args...);}
template<class ...Args>il int mul(const int a,const int b,const Args &...args) {return mul(mul(a,b),args...);}
}
using namespace Modulo;
namespace Miracle{
const int N=3003;
const int M=1e5+5;
int n,K;
int len;
int f[N][N];
int sum[N][N];
int jie[M],inv[M];
int h,z;
int C(int n,int m){
    if(n<0||m<0||n<m) return 0;
    return mul(jie[n],inv[m],inv[n-m]);
}
int s(int x,int y){
    if(x<=0||y<=0) return 0;
    x=min(x,z);y=min(y,h);
    return sum[x][y];
}
int calc(int x1,int y1,int x2,int y2){
    // return sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
    return s(x2,y2)-s(x1-1,y2)-s(x2,y1-1)+s(x1-1,y1-1);
}
int main(){
    rd(n);rd(K);
    int x,y;
    jie[0]=1;
    for(reg i=1;i<=n;++i) jie[i]=mul(jie[i-1],i);
    inv[n]=qm(jie[n]);
    for(reg i=n-1;i>=0;--i) inv[i]=mul(inv[i+1],i+1);
 
    for(reg i=1;i<=n;++i){
        rd(x);rd(y);
        ++x;++y;
        sum[x][y]+=1;
        h=max(h,y);z=max(z,x);
    }   
    for(reg i=1;i<=z;++i){
        for(reg j=1;j<=h;++j){
            sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
            // cout<<" i "<<i<<" j "<<j<<" : "<<sum[i][j]<<endl;
        }
        
    }
    len=0x3f3f3f3f;
    for(reg i=1;i<=h;++i){
        for(reg j=z;j>=1;--j){
            // f[i][j]=min(f[i][j+1]+1,min(i,z-j+1));
            if(j==z) f[i][j]=i;
            else f[i][j]=f[i][j+1]+1;
            // cout<<" sum "<<calc(j,i-f[i][j]+1,j+f[i][j]-1,i)<<endl;
            if(calc(j,i-f[i][j]+1,j+f[i][j]-1,i)>=K){
                // cout<<" ok "<<endl;
                while(calc(j,i-f[i][j]+1,j+f[i][j]-1,i)>=K){
                    len=min(len,f[i][j]);--f[i][j];
                }
                ++f[i][j];
            }
            // cout<<" i "<<i<<" j "<<j<<" : "<<f[i][j]<<endl;
        }
    }
    int ans=0;
    for(reg i=1;i<=h;++i){
        for(reg j=z;j>=1;--j){
            if(f[i][j]==len){
                int now=0;
                int S=calc(j,i-f[i][j]+1,j+f[i][j]-1,i);
                if(S<K) continue;
                int s1=calc(j,i-len+1,j+len-1,i-1);
                int s2=calc(j+1,i-len+1,j+len-1,i);
                int s3=calc(j+1,i-len+1,j+len-1,i-1);
                now=ad(C(S,K),mod-C(s1,K),mod-C(s2,K),C(s3,K));
                inc(ans,now);
            }
        }
    }
 
    printf("%d\n",len-1);
    printf("%d\n",ans);
    return 0;
}
 
}
signed main(){
    // freopen("data.in","r",stdin);
    // freopen("my.out","w",stdout);
    Miracle::main();
    return 0;
}
 
/*
   Author: *Miracle*
 
 
*/