#include <bits/stdc++.h> /* Chang ki si xuyen man dem Di lac vao trong giac mong */ using namespace std; using ll = long long; #define int long long #define pii pair<ll, ll> #define fi first #define se second const ll N = 5e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 19; int n; int l[N], r[N]; int q; vector <int> comp; int nxt[N][lim + 1]; int sz; struct ST { int st[4 * N]; int lz[4 * N]; void lazy(int i, int l, int r) { if (lz[i] != 0) { if (l < r) { st[2 * i] += lz[i]; st[2 * i + 1] += lz[i]; lz[2 * i] += lz[i]; lz[2 * i + 1] += lz[i]; } lz[i] = 0; } } void update(int i, int l, int r, int u, int v, int val) { if (u > r || v < l) return; if (u <= l && r <= v) { st[i] += val; lz[i] += val; return; } int mid = (l + r) / 2; lazy(i, l, r); update(2 * i, l, mid, u, v, val); update(2 * i + 1, mid + 1, r, u, v, val); st[i] = max(st[2 * i], st[2 * i + 1]); } int get(int i, int l, int r, int u, int v) { if (u > r || v < l) return 0; if (u <= l && r <= v) return st[i]; int mid = (l + r) / 2; return max(get(2 * i, l, mid, u, v), get(2 * i + 1, mid + 1, r, u, v)); } } st; void preprocess() { for (int i = 1; i <= n; i++) { comp.push_back(l[i]); comp.push_back(r[i]); } sort(comp.begin(), comp.end()); comp.erase(unique(comp.begin(), comp.end()), comp.end()); sz = comp.size(); for (int i = 1; i <= n; i++) { l[i] = lower_bound(comp.begin(), comp.end(), l[i]) - comp.begin() + 1; r[i] = lower_bound(comp.begin(), comp.end(), r[i]) - comp.begin() + 1; } int P = n; for (int i = n; i >= 1; i--) { st.update(1, 1, sz, l[i], r[i], 1); while(st.get(1, 1, sz, 1, sz) > 1) { st.update(1, 1, sz, l[P], r[P], -1); P--; } nxt[i][0] = P + 1; } } void make() { for (int i = 1; i <= lim; i++) { for (int j = 1; j <= n; j++) { nxt[j][i] = nxt[nxt[j][i - 1]][i - 1]; } } } void solve(int l, int r) { int t = l; int sum = 1; for (int i = lim; i >= 0; i--) { if (nxt[t][i] <= r && nxt[t][i] != 0) { t = nxt[t][i]; sum += (1 << i); } } // cout << t << ' '; cout << sum << '\n'; } signed main() { ios::sync_with_stdio(false); cin.tie(0); if (fopen(".inp", "r")) { freopen(".inp", "r", stdin); freopen(".out", "w", stdout); } cin >> n; for (int i = 1; i <= n; i++) cin >> l[i] >> r[i]; preprocess(); make(); cin >> q; for (int i = 1; i <= q; i++) { int l, r; cin >> l >> r; solve(l, r); } return 0; }

Main.cpp: In function 'int main()':
Main.cpp:106:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:107:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~