提出 #49759468

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
namespace gt = __gnu_pbds;
#define IS_MULTITEST 0

using namespace std;

// #include "angel/math/modint.hpp"

#pragma region Macros
// clang-format off
using ll = long long; using uint = unsigned int; using ull = unsigned long long;
using i32 = int; using i64 = ll; using u32 = uint; using u64 = ull;
using i128 = __int128_t; using u128 = __uint128_t;
using Str = string;
template <class T> using Vec = vector<T>;
template <class T> using RevPriq = priority_queue<T, vector<T>, greater<T>>;
constexpr std::array<std::pair<int, int>, 4> dxy4 = {{{-1, 0}, {0, 1}, {1, 0}, {0, -1}}};
constexpr std::array<std::pair<int, int>, 8> dxy8 = {
    {{-1, -1}, {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}}};
constexpr int inf32 = 1 << 30; constexpr ll inf64 = 1ll << 60;
constexpr char eoln = '\n';
#define L(i, l, r) for (int i = (l); i < (r); ++i)
#define R(i, l, r) for (int i = (r) - 1; i >= (l); --i)
#define ALL(x) (x).begin(), (x).end()
#define mem(a, x) memset((a), (x), sizeof(a))
#define sz(a) (int)((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
// clang-format on
#pragma endregion

// Coding Space

int N;
Vec<int> L, R;
int Q;
Vec<int> P, X;

Vec<int> ans;
Vec<int> qs, ps;

struct UnionFind {
    int n;
    Vec<int> data;
    Vec<gt::tree<pair<int, int>, gt::null_type, less<pair<int, int>>, gt::rb_tree_tag,
                 gt::tree_order_statistics_node_update>>
        ds;

    UnionFind(Vec<int> rs) : n(rs.size()), data(n, -1) {
        ds.resize(n);
        L(i, 0, n) ds[i].insert({rs[i], i});
    }

    int find(int v) {
        if (data[v] < 0) return v;
        else return data[v] = find(data[v]);
    }

    int size(int v) {
        return -data[find(v)];
    }

    void merge(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return;
        if (size(a) < size(b)) swap(a, b);
        data[a] += data[b];
        data[b] = a;
        for (auto &e : ds[b]) ds[a].insert(e);
    }
};

UnionFind uft(Vec<int>(0, 0));
Vec<pair<int, pair<int, int>>> mgs;

void main_() {
    cin >> N;
    L.resize(N);
    R.resize(N);
    L(i, 0, N) {
        cin >> L[i] >> R[i];
    }
    cin >> Q;
    P.resize(Q);
    X.resize(Q);
    L(i, 0, Q) {
        cin >> P[i] >> X[i];
        --P[i];
    }

    qs.assign(Q, 0);
    iota(ALL(qs), 0);
    sort(ALL(qs), [&](int a, int b) { return X[a] > X[b]; });
    ps.assign(N, 0);
    iota(ALL(ps), 0);
    sort(ALL(ps), [&](int a, int b) {
        if (L[a] != L[b]) return L[a] < L[b];
        else return R[a] < R[b];
    });

    uft = UnionFind(R);
    int p = ps[0];
    L(i, 1, N) {
        if (R[p] < L[ps[i]]) {
            p = ps[i];
            continue;
        }
        int d = min(R[ps[i]] - L[ps[i]], (R[p] - L[p]) - (L[ps[i]] - L[p]));
        mgs.pb({d, {p, ps[i]}});
        if (R[p] < R[ps[i]]) p = ps[i];
    }
    sort(ALL(mgs), greater());
    int pi = 0;
    ans.resize(Q);
    L(q, 0, Q) {
        while (pi != size(mgs) and mgs[pi].first >= X[qs[q]]) {
            uft.merge(mgs[pi].se.fi, mgs[pi].se.se);
            ++pi;
        }

        int root = uft.find(P[qs[q]]);
        ans[qs[q]] = uft.size(P[qs[q]]);
        ans[qs[q]] -= uft.ds[root].order_of_key({L[P[qs[q]]] + X[qs[q]], 0});
        if (ans[qs[q]] == 0) ++ans[qs[q]];
    }

    for (auto e : ans) {
        cout << e << '\n';
    }
}

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

    if constexpr (IS_MULTITEST == 0) {
        main_();
    } else {
        // multitest (cf-style)
        int T;
        cin >> T;
        while (T--) {
            main_();
            cout << flush;
        }
    }
}

提出情報

コンパイルエラー

Main.cpp:12: warning: ignoring ‘#pragma region Macros’ [-Wunknown-pragmas]
   12 | #pragma region Macros
      | 
Main.cpp:35: warning: ignoring ‘#pragma endregion ’ [-Wunknown-pragmas]
   35 | #pragma endregion
      | 
Main.cpp: In function ‘void main_()’:
Main.cpp:122:19: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::pair<int, std::pair<int, int> >, std::allocator<std::pair<int, std::pair<int, int> > > >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  122 |         while (pi != size(mgs) and mgs[pi].first >= X[qs[q]]) {
      |                ~~~^~~~~~~~~~~~

ジャッジ結果