Forest

input/code.cpp: In function 'int main()':
input/code.cpp:47:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&n,&q);
                       ^
input/code.cpp:51:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %lf %lf",&a,&h,&pl,&pr);
                                         ^
input/code.cpp:61:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %lf",&x,&v);
                          ^

#include <stdio.h>
#include <algorithm>
using namespace std;
#define N (1<<14)
double st[N<<1];
void update(int i, int j,double v){
  i+=N;
  j+=N;
  if(i==j){
    st[i]*=v;
    return;
  }
  st[i]*=v;
  st[j]*=v;
  while((i>>1)!=(j>>1)){
    if(~i&1)st[i|1]*=v;
    if(j&1)st[j&~1]*=v;
    i>>=1,j>>=1;
  }
}
double query(int a){
  int i = N+a;
  double ri = 1;
  while(i>0){
    ri*=st[i],i>>=1;
  }
  return ri;
}

struct{
  int a;
  int b;
  double v;
} md[202020];

struct qr_t{
  int a;
  double v;
  bool operator<(const qr_t& o) const{return a<o.a;}
} qr[10101];

int mdc=0,qrc=0;

int main(){
  int n,q;
  for(int i=0;i<(N<<1);i++)st[i]=1;
  scanf("%d %d",&n,&q);
  for(int i=0;i<n;++i){
    int a,h;
    double pl,pr;
    scanf("%d %d %lf %lf",&a,&h,&pl,&pr);
    pl/=100;
    pr/=100;
    md[mdc++] = {a-h,a-1,1-pl};
    md[mdc++] = {a+1,a+h,1-pr};
  }
  double r=0;
  for(int i=0;i<q;++i){
    int x;
    double v;
    scanf("%d %lf",&x,&v);
    qr[qrc++]={x,v};
  }
  std::sort(qr,qr+qrc);
  for(int i=0;i<mdc;++i){
    int a=0,b=qrc,c;
    while(b-a>1)c=(a+b)>>1,(md[i].a<=qr[c].a?b:a)=c;
    if(md[i].a>qr[a].a)a++;
    if(a==qrc)continue;
    if(qr[a].a>md[i].b)continue;
    int s = a;
    a=0,b=qrc;
    while(b-a>1)c=(a+b)>>1,(md[i].b<qr[c].a?b:a)=c;
    if(md[i].b<qr[a].a)--a;
    if(a<0)continue;
    if(s>a)continue;
    if(qr[a].a<md[i].a)continue;
    if(qr[s].a>md[i].b)continue;
    update(s,a,md[i].v);
  }
  for(int i=0;i<qrc;++i)r+=query(i)*qr[i].v;
  printf("%.15lf\n",r);
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED