Random Events CodeForces - 1461C（排序+计算概率）

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

Note
Explanation of the first test case: It can be demonstrated that whether the final permutation is sorted or not depends solely on sorting being performed in the (4,0.6) experiment.

题意：

给一个含有n个元素的数组，在给出m个R和P，R表示的是数组中的任意一个元素，P表示的是在这个数组中从小到大排好前R个数的成功概率
本题要求的是排好所有数的成功概率（成功概率=1-失败概率）

Ps：成功率是某一段从小到大排序的成功概率。

思路：

先将给的数组存在另外一个数组中，对另外一个数组进行排序，从后往前遍历，记录第一个不相等的数的下标，这表示后面的数在原给数组序列中已经排好序，我们不需再去计算后面相同的成功率，只需要去计算进行排序的那一段的成功概率即可 计算某一段的成功概率，即计算R>=这一段序列下标的失败率（也就是1-成功率）可能有多个，然后相乘求概率，最后用1-失败概率得到的就是题目所求。

代码：

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[100010],b[100010];
int c[100010];
double d[100010];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m;
        scanf("%d %d",&n,&m);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
            b[i]=a[i]; //把a数组存在b数组中，对b数组进行排序
        }
        for(int i=0; i<m; i++)
            scanf("%d %lf",&c[i],&d[i]);
        sort(b,b+n);
        int minn=-1;
        for(int i=n-1; i>=0; i--)
        {
            if(b[i]!=a[i])
            {
                minn=i;  //从后往前遍历找出第一个不相等的数，记录下标
                break;
            }
        }
        if(minn==-1)  //原来给的序列就是排好序的序列，直接输出1即可
            printf("1.000000\n");
        else
        {
            double s=1;
        for(int i=0;i<m;i++)
        {
            if(c[i]>minn) //计算最终的失败概率
            {
                s=s*(1-d[i]);//失败概率=1-成功概率，多个的情况下是相乘
            }
        }
        printf("%f\n",1-s); //最后输出成功概率，即1-失败概率
        }
    }
    return 0;
}