codeforces 138 C Mushroom Gnomes - 2 【线段树】【离散化】【概率】

C. Mushroom Gnomes - 2

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

One day Natalia was walking in the woods when she met a little mushroom gnome. The gnome told her the following story:

Everybody knows that the mushroom gnomes' power lies in the magic mushrooms that grow in the native woods of the gnomes. There are n trees and m magic mushrooms in the woods: the i-th tree grows at a point on a straight line with coordinates ai and has the height of hi, the j-th mushroom grows at the point with coordinates bj and has magical powers zj.

But one day wild mushroommunchers, the sworn enemies of mushroom gnomes unleashed a terrible storm on their home forest. As a result, some of the trees began to fall and crush the magic mushrooms. The supreme oracle of mushroom gnomes calculated in advance the probability for each tree that it will fall to the left, to the right or will stand on. If the tree with the coordinate x and height h falls to the left, then all the mushrooms that belong to the right-open interval [x - h, x), are destroyed. If a tree falls to the right, then the mushrooms that belong to the left-open interval (x, x + h] are destroyed. Only those mushrooms that are not hit by a single tree survive.

Knowing that all the trees fall independently of each other (i.e., all the events are mutually independent, and besides, the trees do not interfere with other trees falling in an arbitrary direction), the supreme oracle was also able to quickly calculate what would be the expectation of the total power of the mushrooms which survived after the storm. His calculations ultimately saved the mushroom gnomes from imminent death.

Natalia, as a good Olympiad programmer, got interested in this story, and she decided to come up with a way to quickly calculate the expectation of the sum of the surviving mushrooms' power.

Input

The first line contains two integers n and m (1 ≤ n ≤ 105, 1 ≤ m ≤ 104) — the number of trees and mushrooms, respectively.

Each of the next n lines contain four integers — aihiliri (|ai| ≤ 109, 1 ≤ hi ≤ 109, 0 ≤ li, ri, li + ri ≤ 100) which represent the coordinate of the i-th tree, its height, the percentage of the probabilities that the tree falls to the left and to the right, respectively (the remaining percentage is the probability that the tree will stand on).

Each of next m lines contain two integers bjzj (|bj| ≤ 109, 1 ≤ zj ≤ 103) which represent the coordinate and the magical power of the j-th mushroom, respectively.

An arbitrary number of trees and mushrooms can grow in one point.

Output

Print a real number — the expectation of the total magical power of the surviving mushrooms. The result is accepted with relative or absolute accuracy 10 - 4.

Examples

input

Copy

1 1
2 2 50 50
1 1

output

Copy

0.5000000000

input

Copy

2 1
2 2 50 50
4 2 50 50
3 1

output

Copy

0.2500000000

Note

It is believed that the mushroom with the coordinate x belongs to the right-open interval [l, r) if and only if l ≤ x < r. Similarly, the mushroom with the coordinate x belongs to the left-open interval (l, r] if and only if l < x ≤ r.

In the first test the mushroom survives with the probability of 50%, depending on where the single tree falls.

In the second test the mushroom survives only if neither of the two trees falls on it. It occurs with the probability of 50%  ×  50% = 25%.

Pretest №12 is the large test with 105 trees and one mushroom.

#include<bits/stdc++.h>
using namespace std;
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define ll long long
const int MAX = 1e6 + 7;
struct node{
    ll h, len, l, r;
} e[MAX];
vector <ll> v;
#define db double
int mg[MAX], val[MAX];
db a[MAX << 2];
void pushdown(int rt){
    if(a[rt] != 1){
        a[rt << 1] *= a[rt];
        a[rt << 1 | 1] *= a[rt];
        a[rt] = 1;
    }
}
void update(int rt, int l, int r, int x, int y, db v){
    if(x <= l && r <= y){
        a[rt] *= v;
        return;
    }
    pushdown(rt);
    int mid = (l + r) >> 1;
    if(x <= mid) update(lson, x, y, v);
    if(mid < y) update(rson, x, y, v);
}
db query(int rt, int l, int r, int pos){
    if(l == r) return a[rt];
    int mid = (l + r) >> 1;
    pushdown(rt);
    if(pos <= mid) return query(lson, pos);
    else return query(rson, pos);
}
int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    fill(a, a + MAX, 1);
    for(int i = 0; i < n; i++){
        scanf("%lld%lld%lld%lld", &e[i].h, &e[i].len, &e[i].l, &e[i].r);
        v.push_back(e[i].h), v.push_back(e[i].h - e[i].len), v.push_back(e[i].h + e[i].len);
    }
    for(int i = 0; i < m; i++) scanf("%d%d", &mg[i], &val[i]), v.push_back(mg[i]);
    sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end());
    for(int i = 0; i < n; i++){
        int pos = lower_bound(v.begin(), v.end(), e[i].h) - v.begin() + 1;
        int l = lower_bound(v.begin(), v.end(), e[i].h - e[i].len) - v.begin() + 1;
        int r = lower_bound(v.begin(), v.end(), e[i].h + e[i].len) - v.begin() + 1;
        if(pos > l) update(1, 1, 400005, l, pos - 1, (100 - e[i].l) / (db)100);
        if(r > pos) update(1, 1, 400005, pos + 1, r, (100 - e[i].r) / (db)100);
    }
    db ans = 0.0;
    for(int i = 0; i < m; i++){
        mg[i] = lower_bound(v.begin(), v.end(), mg[i]) - v.begin() + 1;
        ans += val[i] * query(1, 1, 400005, mg[i]);
    }
    printf("%lf\n", ans);
    return 0;
}

 

引用\[1\]中提到了一种树形动态规划的方法来解决CodeForces - 982C问题。在这个问题中,subtree指的是子连通块,而不是子树。为了使cnt_white - cnt_black尽可能大,可以使用两次树形动态规划来求解。第一次是自底向上的过程,维护一个dp数组,表示以每个节点为根的子树中的最大连通块。第二次是自顶向下的过程,处理自底向上过程中无法包含的树链所代表的子树。在第二次遍历中,需要维护一个sum变量,用于存储树链所代表的子树的贡献。根据ans\[u\]的正负,决定是否能对相邻的子节点做出贡献。如果ans\[u\]为正,则减去dp\[v\]就是树链所代表的子树的权值。最终,ans\[u\]代表包含节点u在内的子连通块的最大权值。\[1\] 问题: CodeForces - 982C 树形DP是什么问题?如何解决? 回答: CodeForces - 982C是一个树形动态规划问题。在这个问题中,需要求解子连通块的最大权值和,使得cnt_white - cnt_black尽可能大。解决这个问题的方法是使用两次树形动态规划。第一次是自底向上的过程,维护一个dp数组,表示以每个节点为根的子树中的最大连通块。第二次是自顶向下的过程,处理自底向上过程中无法包含的树链所代表的子树。在第二次遍历中,需要维护一个sum变量,用于存储树链所代表的子树的贡献。根据ans\[u\]的正负,决定是否能对相邻的子节点做出贡献。最终,ans\[u\]代表包含节点u在内的子连通块的最大权值。\[1\] #### 引用[.reference_title] - *1* *2* [CodeForces - 1324F Maximum White Subtree(树形dp)](https://blog.csdn.net/qq_45458915/article/details/104831678)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^koosearch_v1,239^v3^insert_chatgpt"}} ] [.reference_item] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值