题目大意:
有n棵树,m个蘑菇,每棵树有坐标a,高度h,向左边倒的概率,向右的概率(概率用0-100表示),向左倒范围[x-h,x)内的蘑菇被破坏,向右倒范围(x,x+h]范围内的蘑菇被破坏。每个蘑菇有坐标b,及它的魔力值z。
问树倒下后,所以蘑菇的魔力值的和的期望。
思路:只需要成段更新出每个点不被压到的概率,然后期望计算即可。
之前wa了很多次,就错在我对于懒惰标记的更新方法
更新子标记的方法是用乘,标记父的方法是用赋值,这样就会出错。假如没有马上转移就会被覆盖,导致没转移
上代码:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define MAX 100005
#define ls rt<<1
#define rs ls|1
#define m (l+r)>>1
double sum[MAX << 4];//注意这边是12倍哦!
double col[MAX << 4];
struct po
{
int a, h;
int l, r;
}tg[MAX];
int pos[MAX << 3];
double power[MAX];
int posm[MAX];
void ups(int rt)
{
if (col[rt] != 1)
{
sum[ls] *= col[rt];
sum[rs] *= col[rt];
col[ls] *= col[rt];
col[rs] *= col[rt];
col[rt] = 1;
}
}
void build(int l, int r, int rt)
{
col[rt] = 1;
sum[rt] = 1;
if (l == r)
{
return;
}
int mid = m;
build(l, mid, ls);
build(mid + 1, r, rs);
}
void updata(int L, int R, double c, int l, int r, int rt)
{
if (L <= l&&r <= R)
{
col[rt] *= c;//这边之前是col[rt]=c;就错了。
sum[rt] *= c;
return;
}
ups(rt);
int mid = m;
if (L <= mid)
updata(L, R, c, l, mid, ls);
if (mid < R)
updata(L, R, c, mid + 1, r, rs);
}
double query(int q, int l, int r, int rt)
{
if (l == r)
return sum[rt];
ups(rt);
int mid = m;
if (q <= mid)
return query(q, l, mid, ls);
return query(q, mid + 1, r, rs);
}
int main()
{
int n, k;
scanf("%d%d", &n, &k);
int cnt = 0;
for (int i = 0; i < n; i++)
{
scanf("%d%d%d%d", &tg[i].a, &tg[i].h, &tg[i].l, &tg[i].r);
pos[cnt++] = tg[i].a;
pos[cnt++] = tg[i].a + tg[i].h;
pos[cnt++] = tg[i].a - tg[i].h;
}
for (int i = 0; i < k; i++)
{
scanf("%d%lf", &posm[i], &power[i]);
pos[cnt++] = posm[i];
}
sort(pos, pos + cnt);
cnt = unique(pos, pos + cnt) - pos;
build(0, cnt - 1, 1);
for (int i = 0; i < n; i++)
{
int cur = lower_bound(pos, pos + cnt, tg[i].a) - pos;
int ll = tg[i].a - tg[i].h;
ll = lower_bound(pos, pos + cnt, ll) - pos;
int rr = lower_bound(pos, pos + cnt, tg[i].a + tg[i].h) - pos;
updata(ll, cur - 1, (100.00 - tg[i].l) / 100.0, 0, cnt - 1, 1);
updata(cur + 1, rr, (100.00 - tg[i].r) / 100.0, 0, cnt - 1, 1);
}
double ans = 0;
for (int i = 0; i < k; i++)
{
int cur = lower_bound(pos, pos + cnt, posm[i]) - pos;
ans += power[i] * query(cur, 0, cnt - 1, 1);
}
printf("%.10lf\n", ans);
}