Submission #61822105

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
static const int MAXD = 700010;
struct Segment {
    long long start, end;
    long long val;
};
void applyContest(int L, int R, vector<Segment> &segs) {
    vector<Segment> newSegs;
    newSegs.reserve(segs.size() + 2);
    for (auto &sg : segs) {
        long long s = sg.start, e = sg.end, v = sg.val;
        if (s >= e) continue;
        long long A = (long long)L - v;
        long long B = (long long)R + 1 - v;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;


static const int MAXD = 700010;

struct Segment {
    long long start, end;
    long long val;
};

void applyContest(int L, int R, vector<Segment> &segs) {
    vector<Segment> newSegs;
    newSegs.reserve(segs.size() + 2);

    for (auto &sg : segs) {
        long long s = sg.start, e = sg.end, v = sg.val;
        if (s >= e) continue;
        long long A = (long long)L - v;
        long long B = (long long)R + 1 - v;

        long long leftEnd = std::min(e, A);
        if (leftEnd > s) {
            newSegs.push_back({s, leftEnd, v});
        }

        long long midStart = std::max(s, A);
        long long midEnd   = std::min(e, B);
        if (midEnd > midStart) {
            newSegs.push_back({midStart, midEnd, v + 1});
        }

        long long rightStart = std::max(s, B);
        if (rightStart < e) {
            newSegs.push_back({rightStart, e, v});
        }
    }

    sort(newSegs.begin(), newSegs.end(), [](auto &a, auto &b){
        return a.start < b.start;
    });

    vector<Segment> merged;
    merged.reserve(newSegs.size());
    for (auto &sg : newSegs) {
        if (!merged.empty()) {
            auto &back = merged.back();
            if (back.end == sg.start && back.val == sg.val) {
                back.end = sg.end;
                continue;
            }
        }
        merged.push_back(sg);
    }

    segs.swap(merged);
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<pair<int,int>> intervals(N);
    for(int i=0; i<N; i++){
        cin >> intervals[i].first >> intervals[i].second;
    }

    vector<Segment> segs;
    segs.push_back({0, MAXD, 0});

    for(int i=0; i<N; i++){
        auto [L, R] = intervals[i];
        applyContest(L, R, segs);
    }

    int Q; cin >> Q;

    while(Q--){
        long long X; 
        cin >> X;
        int low = 0, high = (int)segs.size() - 1;
        long long cVal = 0;
        while (low <= high) {
            int mid = (low + high) >> 1;
            if (segs[mid].start <= X && X < segs[mid].end) {
                cVal = segs[mid].val;
                break;
            }
            if (X < segs[mid].start) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }
        cout << (X + cVal) << "\n";
    }

    return 0;
}

Submission Info

Judge Result