【洛谷 P6144】【USACO20FEB】 Help Yourself P（二项式定理 / 线段树）

传送门

设$f[i][k]$表示$i$为最右点时所有情况的$k$次方
考虑按左端点排序后一个个加入
假设当前加入$l,r$
对于$f[1,l-1],$会从$x^k\to (x+1{)}^k$
二项式定理展开加到$f[r]$即可
对于$f[l,r-1]$会直接加到$r$
对于$f[r+1....]$,答案会乘$2$

用线段树维护即可

复杂度$O(n{k}^2+nklogn)$

#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
    static char ibuf[RLEN],*ib,*ob;
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
    char ch=gc();
    int res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
inline ll readll(){
    char ch=gc();
    ll res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
inline int readstring(char *s){
	int top=0;char ch=gc();
	while(isspace(ch))ch=gc();
	while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
	return top;
}
template<class tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<class tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int mod=1e9+7;
inline int add(int a,int b){return (a+=b)>=mod?(a-mod):a;}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
inline int mul(int a,int b){static ll r;r=1ll*a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){(a+=b)>=mod?(a-=mod):0;}
inline void Dec(int &a,int b){a-=b,a+=a>>31&mod;}
inline void Mul(int &a,int b){static ll r;r=1ll*a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){if(a==0&&b==0)return 0;for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
inline int fix(int x){return (x<0)?x+mod:x;}
cs int N=200005,M=11;
int n,lim,k,C[M][M];
inline void init_inv(){
	for(int i=0;i<M;i++){
		C[i][0]=C[i][i]=1;
		for(int j=1;j<i;j++)
		C[i][j]=add(C[i-1][j],C[i-1][j-1]);
	}
}
struct F{
	int a[M];
	F(){memset(a,0,sizeof(a));}
	inline int& operator[](cs int &p){return a[p];}
	inline const int &operator [](cs int &p)const{return a[p];}
	friend inline F operator +(F a,F b){
		for(int i=0;i<=k;i++)Add(a[i],b[i]);
		return a;
	}
	friend inline F operator *(F a,cs int b){
		for(int i=0;i<=k;i++)Mul(a[i],b);
		return a;
	}
};
namespace Seg{
	cs int N=::N<<2;
	F s[N];int mt[N];
	#define lc (u<<1)
	#define rc ((u<<1)|1)
	#define mid ((l+r)>>1)
	inline void pushup(int u){
		s[u]=s[lc]+s[rc];
	}
	inline void pushnow(int u,int k){
		Mul(mt[u],k),s[u]=s[u]*k;
	}
	inline void pushdown(int u){
		if(mt[u]==1)return;
		pushnow(lc,mt[u]);
		pushnow(rc,mt[u]);
		mt[u]=1;
	}
	void update(int u,int l,int r,int p,cs F &k){
		if(l==r){s[u]=s[u]+k;return;}
		pushdown(u);
		if(p<=mid)update(lc,l,mid,p,k);
		else update(rc,mid+1,r,p,k);
		pushup(u);
	}
	void upmul(int u,int l,int r,int st,int des){
		if(st<=l&&r<=des)return pushnow(u,2);
		pushdown(u);
		if(st<=mid)upmul(lc,l,mid,st,des);
		if(mid<des)upmul(rc,mid+1,r,st,des);
		pushup(u);
	}
	F query(int u,int l,int r,int st,int des){
		if(st<=l&&r<=des)return s[u];
		pushdown(u);
		if(des<=mid)return query(lc,l,mid,st,des);
		if(mid<st)return query(rc,mid+1,r,st,des);
		return query(lc,l,mid,st,des)+query(rc,mid+1,r,st,des);
	}
	inline void init(){
		F a;a[0]=1;
		for(int i=0;i<N;i++)mt[i]=1;
		update(1,0,lim,0,a);
	}
}
pii p[N];
int main(){
	#ifdef Stargazer
	freopen("lx.in","r",stdin);
	#endif
	init_inv();
	n=read(),k=read(),lim=2*n;
	for(int i=1;i<=n;i++){
		p[i].fi=read(),p[i].se=read();
	}
	sort(p+1,p+n+1);
	Seg::init();
	for(int t=1;t<=n;t++){
		int l=p[t].fi,r=p[t].se;
		F tp=Seg::query(1,0,lim,0,l);
		F now;
		//for(int i=0;i<=k;i++)cout<<tp[i]<<" ";puts("");
		for(int i=0;i<=k;i++)
		for(int j=0;j<=i;j++)
		Add(now[i],mul(C[i][j],tp[j]));
		now=now+Seg::query(1,0,lim,l,r-1);
		//for(int i=0;i<=k;i++)cout<<now[i]<<" ";puts("");
		Seg::update(1,0,lim,r,now);
		if(r<lim)Seg::upmul(1,0,lim,r+1,lim);
	}
	cout<<Seg::query(1,0,lim,0,lim)[k]<<'\n';
	return 0;
}