一段路上的某些位置有地雷,一个人从1开始,每一次走一步的概率是p,走两步的概率是1-p,问到达终点的概率。 题目本身是一个概率问题。假设dp[i]表示到达i点的概率,那么dp[i]=p*dp[i-1]+(1-p)*dp[i-2],且dp[1]=1,dp[2]=p,但是从题目的数据范围来看,无论是时间还是空间都不满足。 分析递推方程能看出,一个点的概率只与其前面的两个点有关,因此我们可以将其转换为矩阵相乘,我们定义矩阵A: 和B: ,第二个矩阵是初始状态,第一个矩阵是转换矩阵。A左乘B矩阵而如果不考虑后面的unknow,那么B矩阵完全可以用A矩阵代替。A左乘B之后可以得到下一个状态 ,当然A*B也是可以得到这个状态的。但是这并没有解决时空复杂度的问题。 有了上面的基础,下面我们对整个路径进行一下处理,即以地雷所在的位置为分割点进行分割,那么可以做到分割出的每一段都是只在路径的末端包含一个地雷,我们将平安通过每一段路称为一个独立事件,且这个事件的概率就是1减去到达这一段的地雷的概率,因为只要不踩到这个地雷,就可以顺利到达下一段,这样,我们利用矩阵的快速幂算出每一段的概率,再利用乘法定律,就可以得到答案。Scout YYF I
Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7362 Accepted: 2150 Description
YYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficulties, YYF is now at the start of enemy's famous "mine road". This is a very long road, on which there are numbers of mines. At first, YYF is at step one. For each step after that, YYF will walk one step with a probability of p, or jump two step with a probality of 1- p. Here is the task, given the place of each mine, please calculate the probality that YYF can go through the "mine road" safely.Input
The input contains many test cases ended with EOF. Each test case contains two lines. The First line of each test case is N (1 ≤ N ≤ 10) and p (0.25 ≤ p ≤ 0.75) seperated by a single blank, standing for the number of mines and the probability to walk one step. The Second line of each test case is N integer standing for the place of N mines. Each integer is in the range of [1, 100000000].Output
For each test case, output the probabilty in a single line with the precision to 7 digits after the decimal point.Sample Input
1 0.5 2 2 0.5 2 4Sample Output
0.5000000 0.2500000Source
#include <iostream> #include <stdio.h> #include <string.h> #include <algorithm> using namespace std; struct Matrix { double mat[2][2]; }; Matrix mul(Matrix a,Matrix b) { Matrix ret; for(int i=0;i<2;i++) { for(int j=0;j<2;j++) { ret.mat[i][j]=0; for(int k=0;k<2;k++) ret.mat[i][j]+=a.mat[i][k]*b.mat[k][j]; } } return ret; } Matrix pow_M(Matrix a,int n) { Matrix ret; memset(ret.mat,0,sizeof(ret.mat)); for(int i=0;i<2;i++) ret.mat[i][i]=1; Matrix temp=a; while(n) { if(n&1) ret=mul(ret,temp); temp=mul(temp,temp); n>>=1; } return ret; } int main() { int n; int pos[20]; double p; Matrix trans,tmp; while(cin>>n>>p) { trans.mat[0][0]=p; trans.mat[0][1]=1-p; trans.mat[1][0]=1; trans.mat[1][1]=0; for(int i=0;i<n;i++) scanf("%d",&pos[i]); sort(pos,pos+n); double ans=1.0; tmp=pow_M(trans,pos[0]-1); ans*=(1-tmp.mat[0][0]); for(int i=1;i<n;i++) { if(pos[i]==pos[i-1]) continue; tmp=pow_M(trans,pos[i]-pos[i-1]-1); ans*=(1-tmp.mat[0][0]); } printf("%.7f\n",ans); } return 0; }
查看原文:http://colorfulshark.cn/wordpress/scout-yyf1-1035.html
POJ 3711 Scout YYF I 概率DP + 矩阵快速幂
最新推荐文章于 2021-07-29 11:16:49 发布