POJ3744 矩阵快速幂

最新推荐文章于 2021-09-11 19:55:36 发布

Gipsyu

最新推荐文章于 2021-09-11 19:55:36 发布

阅读量123

点赞数

本文链接：https://blog.csdn.net/Gipsy_Danger/article/details/83114190

版权

挺简单的不说了

题有坑输出%f才对

#include<iostream>
#include<map>
#include<algorithm>
#include<stdio.h>
using namespace std;
int A[100010];
map<int,double> DP;
const int N=2;
void matmul(double A[N+5][N+5],double B[N+5][N+5],double ans[N+5][N+5]){
    double Ans[N+5][N+5];
    for(int i=1;i<=N;++i)for(int j=1;j<=N;++j)Ans[i][j]=0;
    for(int i=1;i<=N;++i)for(int j=1;j<=N;++j)for(int k=1;k<=N;++k)Ans[i][j]+=A[i][k]*B[k][j];
    for(int i=1;i<=N;++i)for(int j=1;j<=N;++j)ans[i][j]=Ans[i][j];
}
void matpow(double A[N+5][N+5],int x,double ans[N+5][N+5]){
    double Ans[N+5][N+5],B[N+5][N+5];
    for(int i=1;i<=N;++i)for(int j=1;j<=N;++j)Ans[i][j]=0,B[i][j]=A[i][j];
    for(int i=1;i<=N;++i)Ans[i][i]=1;
    for(;x;x/=2){
        if(x%2==1)matmul(Ans,B,Ans);
        matmul(B,B,B);
    }
    for(int i=1;i<=N;++i)for(int j=1;j<=N;++j)ans[i][j]=Ans[i][j];
}
int main(){
    int n;double p;
    D:
    while(scanf("%d%lf",&n,&p)!=-1){
        double AA[N+5][N+5]={{0},{0,0,1-p},{0,1,p}};
        double B[N+5][N+5];
        for(int i=1;i<=n;++i)scanf("%d",&A[i]);
        sort(A+1,A+1+n);
        if(A[1]==1){
        	printf("0.0000000\n");
            goto D;
		}
        for(int i=1;i<n;++i){
            if(A[i+1]-A[i]==1){
                printf("0.0000000\n");
                goto D;
            }
        }
        int now=1;
        DP[0]=0;
        DP[1]=1;
        for(int i=1;i<=n;++i){
            if(now==A[i]-1){
                DP[A[i]]=0;
                DP[A[i]+1]=DP[A[i]-1]*(1-p);
            }else{
                matpow(AA,A[i]-1-now,B);
                DP[A[i]-1]=DP[now-1]*B[1][2]+DP[now]*B[2][2];
                DP[A[i]]=0;
                DP[A[i]+1]=DP[A[i]-1]*(1-p);
            }
            now=A[i]+1;
        }
        printf("%.7f\n",DP[A[n]+1]);
    }
}