Scout YYF I

/*
题意：一条路上有n个地雷，从1出发，每次可走一步或两步，走一步的概率为p，走两步的概率为1-p
思路：可以想到dp[i]=dp[i-2]*（1-p）+dp[i-1]*p，但是由于数据可能达到1e8，暴力不可为，故
我们可以根据埋地雷的位置来求地雷前一步的安全概率，且地雷的位置安全概率为0，由此可以推出最后一个地雷后的安全概率，
实现：矩阵快速幂+概率dp
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
typedef struct {
	double m[2][2];
}Matrix;
int n;
double p;
int b[15];
double dp[3];   //dp[1]代表前一个，dp[0]代表前一个-1

Matrix multiple(Matrix a, Matrix b) {
	Matrix res;
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			double sum = 0;
			for (int k = 0; k < 2; k++) {
				sum += a.m[i][k] * b.m[k][j];
			}
			res.m[i][j] = sum;
		}
	}
	return res;
}

Matrix qpow(Matrix a, int b) {
	Matrix res;
	res.m[0][0] = res.m[1][1] = 1;
	res.m[0][1] = res.m[1][0] = 0;
	while (b) {
		if (b & 1)res = multiple(res, a);
		a = multiple(a, a);
		b >>= 1;
	}
	return res;
}

int main() {
	while (scanf("%d%lf", &n, &p) != EOF) {
		Matrix a;
		a.m[0][0] = 0;
		a.m[0][1] = 1 - p;
		a.m[1][0] = 1;
		a.m[1][1] = p;
		for (int i = 1; i <= n; i++) {
			scanf("%d", &b[i]);
		}
		sort(b + 1, b + n + 1);
		b[0] = 0;
		bool flag = false;
		for (int i = 1; i <= n; i++) {
			if (b[i] - b[i - 1] == 1) {
				flag = true;
				break;
			}
		}
		if (flag) {
			printf("%.7f\n", 0);
			continue;
		}
		else if (n == 0) {
			printf("%.7f\n", 1.0);
		}
		else {
			dp[1] = 1;
			dp[0] = 0;
			int pre = 1;
			for (int i = 1; i <= n; i++) {
				int now = b[i] - 1;
				if (now == 1) {
					dp[1] = 0;
					dp[0] = 1;
				}
				else {
					Matrix res = qpow(a, now - pre);
					dp[0] = dp[0] * res.m[0][1] + dp[1] * res.m[1][1];
					dp[1] = 0;
				}
				pre = b[i];
			}
			double ans = dp[1] * p + dp[0] * (1 - p);
			printf("%.7f\n", ans);
		}
	}
}