CCC 2026 S2 Beams of Light

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4using i128 = __int128;
    5const int inf = 1e9;
    6const ll INF = 1e17;
    7void solve1() {
    8    int n, l, q; cin >> n >> l >> q;
    9    vector<int> diff(n + 2);
    10    for (int i = 0; i < l; i++) {
    11        int a, b; cin >> a >> b;
    12        diff[max(1, a - b)]++;
    13        diff[min(n + 1, a + b + 1)]--;
    14    }
    15    for (int i = 1; i <= n; i++) diff[i] += diff[i - 1];
    16    for (int i  = 0; i < q; i++) {
    17        int x; cin >> x;
    18        cout << (diff[x] ? "Y": "N") << '\n';
    19    }
    20}
    21void solve2() {
    22    int n, l, q; cin >> n >> l >> q;
    23    vector<pair<int, int>> seg;
    24    for (int i = 0; i < l; i++) {
    25        int a, b; cin >> a >> b;
    26        seg.emplace_back(max(1, a - b), min(n, a + b));
    27    }
    28    sort(seg.begin(), seg.end());
    29    vector<pair<int, int>> ss;
    30    for (int i = 0, j = 0; i < seg.size(); i++) {
    31        auto[a, b] = seg[i];
    32        j = i + 1;
    33        while (j < seg.size() && seg[j].first <= b) {
    34            b = max(b, seg[j].second);
    35            j++;
    36        }
    37        i = j - 1;
    38        ss.emplace_back(a, b);
    39    }
    40    for (int i = 0; i < q; i++) {
    41        int x; cin >> x;
    42        pair p = {x, inf};
    43        int pos = upper_bound(ss.begin(), ss.end(), p) - ss.begin();
    44        pos = max(0, pos - 1);
    45        auto[a, b] = ss[pos];
    46        if (x >= a && x <= b) {
    47            cout << "Y" << '\n';
    48        } else {
    49            cout << "N" << '\n';
    50        }
    51    }
    52}
    53int main() {
    54    ios::sync_with_stdio(0); cin.tie(0);
    55    solve1();
    56    return 0;
    57}