Codeforces722E Research Rover dp+逆元+前缀和

最新推荐文章于 2020-08-18 15:50:05 发布

ILoveFujibayashiRyou

最新推荐文章于 2020-08-18 15:50:05 发布

阅读量2.7k

点赞数 2

分类专栏： Codeforces题目文章标签： dp 乘法逆元 Codeforces CF

本文链接：https://blog.csdn.net/The_OIer/article/details/97234100

版权

Codeforces题目专栏收录该内容

11 篇文章 0 订阅

订阅专栏

题目链接：传送门

Research rover finally reached the surface of Mars and is ready to complete its mission. Unfortunately, due to the mistake in the navigation system design, the rover is located in the wrong place.

The rover will operate on the grid consisting of n rows and m columns. We will define as (r, c) the cell located in the row r and column c. From each cell the rover is able to move to any cell that share a side with the current one.

The rover is currently located at cell (1, 1) and has to move to the cell (n, m). It will randomly follow some shortest path between these two cells. Each possible way is chosen equiprobably.

The cargo section of the rover contains the battery required to conduct the research. Initially, the battery charge is equal to s units of energy.

Some of the cells contain anomaly. Each time the rover gets to the cell with anomaly, the battery looses half of its charge rounded down. Formally, if the charge was equal to x before the rover gets to the cell with anomaly, the charge will change to .

While the rover picks a random shortest path to proceed, compute the expected value of the battery charge after it reaches cell (n, m). If the cells (1, 1) and (n, m) contain anomaly, they also affect the charge of the battery.

Input
The first line of the input contains four integers $n, m, k$ and $s$ $(1 \leq n, m \leq 100000, 0 \leq k \leq 2000, 1 \leq s \leq 1000000)$ — the number of rows and columns of the field, the number of cells with anomaly and the initial charge of the battery respectively.

The follow $k$ lines containing two integers $r_i$ and $c_i$ $1 ≤ r_i ≤ n, 1 ≤ c_i ≤ m)$ — coordinates of the cells, containing anomaly. It’s guaranteed that each cell appears in this list no more than once.

Output
The answer can always be represented as an irreducible fraction $\frac{P}{Q}$ . Print the only integer $P·Q^{-1}$ modulo $10^9+7$ .

需要点亮的技能：
$1 . O (n)$ 求阶乘的逆元。
$2 .$ 熟练运用组合数。
$3 . d p$ 技巧。

首先~~yy出~~这是个dp。
把题目给出的特殊点排序，以 $x$ 坐标为第一关键字， $y$ 坐标为第二关键字。
发现 $n, m$ 珂以达到 $10^5$ 级别，因此不考虑将其设计成子状态的某一维。
发现 $k$ 比较小，考虑让 $k$ 作为子状态的一维。
令 $d p [i] [j]$ 表示从第 $i$ 个特殊点，恰好经过 $j$ 个特殊点走到 $(n, m)$ 的情况数。
令 $d [i] [j]$ 表示从第 $i$ 个特殊点走到第 $j$ 个特殊点的方案数。
显然 $d[i][j]=C_{x[j]-x[i]+y[j]-y[i]}^{x[j]-x[i]}$ 。

转移 $d p [i] [j]$ 时注意到恰好走 $j$ 个特殊点不好转移，
于是令 $f [i] [j]$ 表示从第 $i$ 个特殊点，至多经过 $j$ 个特殊点走到 $(n, m)$ 的方案数。
然后珂以利用容斥原理（所有的情况 $-$ 经过特殊点数超过 $j$ 的情况）转移：
枚举 $i, j$ 和经过的一个特殊点 $l$ ，排除掉既经过 $l$ ，又除 $l$ 外经过 $j$ 个特殊点的情况数。
故珂以写出代码：

f[i][j]=f[i][len];
for(re l=k; l>i; l--) {
	if(w[i].y<=w[l].y) {
		f[i][j]=(f[i][j]-dp[l][j]*d[i][l]%mod+mod)%mod;
	}
}

珂以看出 $f [i] [j]$ 是 $d p [i] [j]$ 的前缀和，
然后 $d p [i] [j]$ 就珂以通过 $f [i] [j]$ 求出。

放上~~毒瘤无比的~~代码：

#include<stdio.h>
#include<cstring>
#include<algorithm>
#define re register int
using namespace std;
typedef long long ll;
inline char getc() {
    static char buf[262145],*fs,*ft;
    return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<18,stdin)),fs==ft)?EOF:*fs++;
}
int read() {
	re x=0,f=1;
	char ch=getc();
	while(ch<'0' || ch>'9') {
		if(ch=='-')	f=-1;
		ch=getc();
	}
	while(ch>='0' && ch<='9') {
		x=10*x+ch-'0';
		ch=getc();
	}
	return x*f;
}
ll fastpow(ll b,ll p,ll k) {
	ll ans=1;
	while(p) {
		if(p&1)	ans=ans*b%k;
		b=b*b%k;
		p>>=1;
	}
	return ans;
}
const int Size=2005;
const int Maxn=200005;
const ll mod=1e9+7;
int n,m,k,s,a[Size];
ll d[Size][Size],f[Size][21],dp[Size][21];
ll fac[Maxn],inv[Maxn];
struct node {
	int x,y;
} w[Size];
inline bool comp(node mhy,node ypy) {
	if(mhy.x!=ypy.x)	return mhy.x<ypy.x;
	return mhy.y<ypy.y;
}
inline ll C(int n,int m) {
	return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
inline ll Inv(ll x) {
	return fastpow(x,mod-2,mod);
}
int main() {
	n=read();
	m=read();
	k=read();
	s=read();
	fac[0]=1;
	for(re i=1; i<=n+m; i++) {
		fac[i]=fac[i-1]*i%mod;
	}
	inv[n+m]=Inv(fac[n+m]);
	for(re i=n+m-1; i>=0; i--) {
		inv[i]=inv[i+1]*(i+1)%mod;
	}
	for(re i=1; i<=k; i++) {
		w[i].x=read();
		w[i].y=read();
	}
	sort(w+1,w+1+k,comp);
	w[0].x=w[0].y=1;
	for(re i=0; i<=k; i++) {
		d[i][i]=1;
		for(re j=i+1; j<=k; j++) {
			if(w[i].y<=w[j].y) {
				d[i][j]=C(w[j].y-w[i].y+w[j].x-w[i].x,w[j].x-w[i].x);
			}
		}
	}
	a[0]=s;
	int len=0;
	while(s!=1) {
		a[++len]=s=(s+1)>>1;
	}
	for(re i=k; i>=0; i--) {
		f[i][len]=C(n+m-w[i].x-w[i].y,n-w[i].x);
		for(re j=0; j<len; j++) {
			f[i][j]=f[i][len];
			for(re l=k; l>i; l--) {
				if(w[i].y<=w[l].y) {
					f[i][j]=(f[i][j]-dp[l][j]*d[i][l]%mod+mod)%mod;
				}
			}
		}
		for(re j=len; j; j--) {
			dp[i][j]=(f[i][j]-f[i][j-1]+mod)%mod;
		}
		dp[i][0]=f[i][0];
	}
	ll ans=0;
	for(re i=0; i<=len; i++) {
		dp[0][i]=(dp[0][i]%mod+mod)%mod;
		ans=(ans+dp[0][i]*a[i]%mod)%mod;
	}
	ans=ans*Inv(C(n+m-2,n-1))%mod;
	printf("%lld",ans);
	return 0;
}