题目:https://codeforces.com/contest/1461/problem/C
题目:
很难想想这题居然用二分能写。
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long int LL ;
const LL mod = 1e9 + 7;
const int N = 1e5 + 10;
int a[N];
const long double one = 1.00000000000000000;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--)
{
int n , m ;
cin >> n >> m ;
for(int i = 1 ; i <= n ; i ++)
cin >> a[i];
int num = n;
int temp = 0 ;
for(int i = n ; i >= 1; i --)
{
if(a[i] == i)num = i ,temp ++ ;
else
{
num = i ;
break;
}
}
long double ans = 0 ;
long double p ;
int k;
while(m--)
{
cin >> k >> p ;
if(k < num)continue;
else if(k >= num)
{
if(ans == 0)ans = p;
else
{
ans += p*(one - ans);
}
}
}
if(temp == n)
{
puts("1.000000");
continue;
}
printf("%.6Lf\n",ans);
}
return 0 ;
}