Forest

#include <bits/stdc++.h>
#define UNVISITED -1
#define BIGINT 1 << 25
#define _ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0), cout.precision(15);
using namespace std;

typedef long long int64;
typedef pair<int, int> ii;

class Tree{
public:
    Tree(int p, int h, int left, int right){
        this->p = p;
        this->h = h;
        this->left = left;
        this->right = right;
    }

    int getP(){
        return p;
    }

    int getLeftRange(){
        return max(p - h, 0);
    }

    int getRightRange(){
        return p + h;
    }

    double getLeft(){
        return left / 100.0;
    }

    double getRight(){
        return right / 100.0;
    }

private:
    int p, h, left, right;
};

int main(){ _
    int n, m;   cin >> n >> m;
    vector<Tree> trees;
    for(int i = 0; i < n; ++i){
        int p, h, left, right;
        cin >> p >> h >> left >> right;
        trees.push_back(Tree(p, h, left, right));
        // cout << trees[i].getLeft() << endl;
    }

    vector< ii > mush;
    vector<int> mushP;
    vector<double> prob(m, 1.0);
    for(int i = 0; i < m; ++i){
        int p, val; cin >> p >> val;
        mushP.push_back(p);
        mush.push_back(ii(p, val));
    }
    sort(mush.begin(), mush.end());
    sort(mushP.begin(), mushP.end());
    mushP.push_back(BIGINT);

    for(int i = 0; i < n; ++i){
        int p = trees[i].getP();
        int leftRange = trees[i].getLeftRange();
        int rightRange = trees[i].getRightRange();
        double leftP = trees[i].getLeft();
        double rightP = trees[i].getRight();


        // cout << leftRange << " " << rightRange << endl;

        vector<int>::iterator low, up;
        low = lower_bound(mushP.begin(), mushP.end(), leftRange);
        up = upper_bound(mushP.begin(), mushP.end(), rightRange);
        int diffA = low - mushP.begin();
        int diffB = up - mushP.begin();

        // cout << (up == mushP.end()) << endl;

        // cout << diffA << "\t" << diffB << endl;
        for(int j = diffA; j < diffB; ++j){
            if(mush[j].first == p)  continue;
            else if(mush[j].first < p)  prob[j] *= (1.0 - leftP);
            else    prob[j] *= (1.0 - rightP);
        }
    }

    double total = 0;
    for(int i = 0; i < m; ++i){
        total += prob[i] * mush[i].second;
    }
    cout << total << endl;

    return 0;
}

Test 1

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED