题意:给n个地雷的坐标,每次从1开始走,走一步的概率是p,走两步的概率是1-p,求能安全通过的可能性。
解题思路:dp[i] = p*dp[i-1] + (1-p)*dp[i-2],其中下标能到达100000000,所以要用矩阵优化。注意输出用%.7f。
代码如下:
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
using namespace std;
int a[100];
double p;
struct Matrix
{
double m[3][3];
Matrix()
{
memset(m,0,sizeof(m));
}
}A,I;
void init()
{
A.m[0][0] = 0;
A.m[0][1] = 1-p;
A.m[1][0] = 1;
A.m[1][1] = p;
I.m[0][0] = I.m[1][1] = 1;
}
Matrix matrixmul(Matrix a,Matrix b,int k)
{
int i,j,o;
Matrix c;
for(i = 0; i < k; i++)
for(j = 0; j < k; j++)
for(o = 0; o < k; o++)
c.m[i][j] = c.m[i][j] + a.m[i][o]*b.m[o][j];
return c;
}
Matrix matrixpow(Matrix a,int n,int k)
{
Matrix b = I;
while(n)
{
if(n&1) b = matrixmul(b,a,k);
a = matrixmul(a,a,k);
n /= 2;
}
return b;
}
int main()
{
int n;
while(scanf("%d%lf",&n,&p) != EOF)
{
init();
int i;
for(i = 0; i < n; i++) scanf("%d",&a[i]);
sort(a,a+n);
n = unique(a,a+n) - a;
if(a[0] == 1){
printf("0.0000000\n");
continue;
}
int flag = 0;
for(i = 1; i < n; i++)
if(a[i] - a[i-1] == 1) flag = 1;
if(flag){
printf("0.0000000\n");
continue;
}
double ans = 0;
Matrix b = matrixpow(A,a[0]-1,2);
ans += b.m[0][0] + p*b.m[1][0];
// cout<<ans<<endl;
double temp;
if(a[0] == 2) temp = 1;
else {
b = matrixpow(A,a[0]-2,2);
temp = b.m[0][0] + p*b.m[1][0];
}
temp *= (1-p);
for(i = 1; i < n; i++)
{
b = matrixpow(A,a[i] - (a[i-1]+1),2);
ans = ans + temp*(b.m[0][0] + p*b.m[1][0]);
b = matrixpow(A,a[i] - (a[i-1]+1)-1,2);
temp = temp*(b.m[0][0] + p*b.m[1][0]);
temp *= (1-p);
// cout<<ans<<" "<<temp<<endl;
}
printf("%.7f\n",1-ans);
}
return 0;
}