Codeforces Round #689 (Div. 2) C. Random Events（概率）

题目链接：https://codeforc.es/contest/1461/problem/C

Ron is a happy owner of a permutation a of length n.

A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).

Ron’s permutation is subjected to m experiments of the following type: (ri, pi). This means that elements in range [1,ri] (in other words, the prefix of length ri) have to be sorted in ascending order with the probability of pi. All experiments are performed in the same order in which they are specified in the input data.

As an example, let’s take a look at a permutation [4,2,1,5,3] and an experiment (3,0.6). After such an experiment with the probability of 60% the permutation will assume the form [1,2,4,5,3] and with a 40% probability it will remain unchanged.

You have to determine the probability of the permutation becoming completely sorted in ascending order after m experiments.

Input
Each test contains one or more test cases. The first line contains the number of test cases t (1≤t≤100).

The first line of each test case contains two integers n and m (1≤n,m≤105) — the length of the permutation and the number of experiments, respectively.

The second line of each test case contains n integers a1,a2,…,an (1≤ai≤n) — contents of the permutation.

The following m lines of each test case each contain an integer ri and a real number pi (1≤ri≤n,0≤pi≤1) — the length of the prefix and the probability of it being sorted. All probabilities are given with at most 6 decimal places.

It is guaranteed that the sum of n and the sum of m does not exceed 105 (∑n,∑m≤105).

Output
For each test case, print a single number — the probability that after all experiments the permutation becomes sorted in ascending order. Your answer will be considered correct if its absolute or relative error does not exceed 10−6.

Formally, let your answer be a, and the jury’s answer be b. Your answer is accepted if and only if |a−b|max(1,|b|)≤10−6.

Example

input

4
4 3
4 3 2 1
1 0.3
3 1
4 0.6
5 3
4 2 1 3 5
3 0.8
4 0.6
5 0.3
6 5
1 3 2 4 5 6
4 0.9
5 0.3
2 0.4
6 0.7
3 0.5
4 2
1 2 3 4
2 0.5
4 0.1

output

0.600000
0.720000
0.989500
1.000000

---

分析

可以发现从右往左第一个错误的数 x 的左边的位置的概率是无效的，所以我们只要用 x 以及 x 右边的位置的概率就可以了。
如果 x 及 x 右侧的概率中有一个是排序的就可以成功，那么我们只要算每个都不排序的概率， 1 - 这个值 就是答案。
注意题目给的概率的位置是会重复的……
如果本身就是排序好的，那么答案就是 1 。

代码

#include<bits/stdc++.h>
using namespace std;

int n,m;
int a[100007],num[100007];
double p[100007], y;

void solve()
{
	double ans;
	int x;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=m;i++)
	{
		scanf("%d%lf",&x,&y);
		num[i] = x;
		p[i] = y;
	}
	int begin = n;
	for(int i=n;i>=1;i--)
	{
		begin = i;
		if(a[i] != i) break;
	}
	if(begin == 1)
	{
		printf("%lf\n",1.0);
		return;
	}
	double tmp = 1.0;
	for(int i=1;i<=m;i++)
	{
		if(num[i] >= begin) tmp *= (1.0 - 1.0 * p[i]);
	}
	ans = 1.0 - tmp;
	printf("%lf\n",ans);
}

int main()
{
	int T = 1;
	scanf("%d",&T);
	while(T--)
	{
		solve();
	}
	return 0;
}