poj3744（概率dp+矩阵快速幂）

最新推荐文章于 2019-09-09 16:41:30 发布

__meteor

最新推荐文章于 2019-09-09 16:41:30 发布

阅读量250

点赞数

分类专栏： # dp ACM

本文链接：https://blog.csdn.net/du_lun/article/details/79530408

版权

ACM 同时被 2 个专栏收录

124 篇文章 0 订阅

订阅专栏

47 篇文章 0 订阅

订阅专栏

Scout YYF I

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10134		Accepted: 2958

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

Sample Output

0.5000000
0.2500000

Source

POJ Monthly Contest - 2009.08.23, Simon

[Submit] [Go Back] [Status] [Discuss]

思路：

第一反应是从头暴力可以通过dp[i]=p*dp[i-1] + (1-p)*dp[i-2]状态转移方程求出dp[i]，但是地雷范围太大，会T

很难想到一点通过构造矩阵求出dp[i], 我构造的是

[ dp[i-1], dp[i-2] ] * p 1

(1-p) 0

构造完成后可以将地雷分区间，使得每个区间最后一个点是地雷，这样顺利通过该区间的概率就是 1-该点概率，最后每个区间用乘法原理。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1e3+10;

int n;
int pos[20];
double p;

struct Matrix{
    double m[2][2];
};

/*
    构造矩阵 p      1
              (1-p)  0
*/

Matrix mul_M(Matrix a, Matrix b){

    Matrix c;

    for(int i=0; i<2; i++)
    {
        for(int j=0; j<2; j++)
        {
            c.m[i][j]=0;
            for(int k=0; k<2; k++)
                c.m[i][j]+= a.m[i][k] * b.m[k][j];
        }
    }
    return c;
}

Matrix pow_M(Matrix x, int num){

    Matrix ans;
    ans.m[0][0]=ans.m[1][1]=1;
    ans.m[0][1]=ans.m[1][0]=0;

    while(num){

        if(num&1)
        {
            ans=mul_M(ans, x);
        }

        x=mul_M(x, x);
        num>>=1;
    }
    return ans;
}

int main(){
    while(~scanf("%d%lf", &n, &p)){
        for(int i=1; i<=n; i++)
            scanf("%d", &pos[i]);
        sort(pos+1, pos+1+n);

        Matrix v;
        v.m[0][0]=p; v.m[0][1]=1; v.m[1][0]=1-p; v.m[1][1]=0;

        double ans=1;
        for(int i=1; i<=n; i++)
        {

            Matrix tmp=pow_M(v, pos[i]-pos[i-1]-1);
            ans*=(1-tmp.m[0][0]);
        }


        printf("%.7lf\n", ans);

    }
    return 0;
}