#include <bits/stdc++.h> using namespace std; #define POPCOUNT(n) (__builtin_popcountll((n))) #define CLZ(n) (__builtin_clzll((n))) #define CTZ(n) (__builtin_ctzll((n))) #define LOG(n) (63 - __builtin_clzll((n))) #define BIT(n, i) (((n) >> (i)) & 1ll) #define MASK(i) (1ll << (i)) #define FLIP(n, i) ((n) ^ (1ll << (i))) #define ON(n, i) ((n) | MASK(i)) #define OFF(n, i) ((n) & ~MASK(i)) #define Int __int128 #define fi first #define se second typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> pii; typedef pair<long long, long long> pll; typedef pair<long long, int> pli; typedef pair<int, long long> pil; typedef vector<pair<int, int>> vii; typedef vector<pair<long long, long long>> vll; typedef vector<pair<long long, int>> vli; typedef vector<pair<int, long long>> vil; template <class T1, class T2> bool maximize(T1 &x, T2 y) { if (x < y) { x = y; return true; } return false; } template <class T1, class T2> bool minimize(T1 &x, T2 y) { if (x > y) { x = y; return true; } return false; } template <class T> void remove_duplicate(vector<T> &ve) { sort (ve.begin(), ve.end()); ve.resize(unique(ve.begin(), ve.end()) - ve.begin()); } mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); long long random(long long l, long long r) { return uniform_int_distribution<long long>(l, r)(rng); } unsigned long long random(unsigned long long l, unsigned long long r) { return uniform_int_distribution<unsigned long long>(l, r)(rng); } template <class T> T random(T r) { return rng() % r; } const int N = 1e6 + 5; const int MOD = 1e9 + 7; const int inf = 1e9; const long long INF = 1e18; int n, q, maxNode; int L[N], R[N], nodeId[N], dist[2][4 * N], cost[4 * N]; vii adj[4 * N]; void build(int id, int l, int r) { maximize(maxNode, id); if (l == r) { nodeId[l] = id; return; } int mid = (l + r) >> 1; build(id << 1, l, mid); build(id << 1 | 1, mid + 1, r); adj[id << 1].emplace_back(id, 0); adj[id << 1 | 1].emplace_back(id, 0); } void add(int id, int l, int r, int u, int v, int x) { if (l > v || r < u) return; if (u <= l && r <= v) { adj[id].emplace_back(x, 1); return; } int mid = (l + r) >> 1; add(id << 1, l, mid, u, v, x); add(id << 1 | 1, mid + 1, r, u, v, x); } void bfs(int source, int type) { for (int i = 1; i <= maxNode; ++i) dist[type][i] = inf; deque<int> q; q.emplace_back(source); dist[type][source] = 0; while (!q.empty()) { int u = q.front(); q.pop_front(); for (auto [v, w] : adj[u]) if (minimize(dist[type][v], dist[type][u] + w)) { if (w == 0) q.emplace_front(v); else q.emplace_back(v); } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; build(1, 1, n); for (int i = 1; i <= n; ++i) { cin >> L[i] >> R[i]; add(1, 1, n, L[i], R[i], nodeId[i]); } bfs(nodeId[1], 0); bfs(nodeId[n], 1); priority_queue<pii, vii, greater<pii>> dq; memset(cost, 0x0f, sizeof cost); for (int i = 1; i <= n; ++i) { cost[nodeId[i]] = dist[0][nodeId[i]] + dist[1][nodeId[i]]; dq.emplace(cost[nodeId[i]], nodeId[i]); // cerr << cost[nodeId[i]] << ' '; } // cerr << '\n'; // sort (dq.begin(), dq.end(), [&](int x, int y) { // return cost[x] < cost[y]; // }); while (!dq.empty()) { int u = dq.top().se; dq.pop(); cerr << u << '\n'; for (auto [v, w] : adj[u]) if (minimize(cost[v], cost[u] + w)) { dq.emplace(cost[v], v); } } cin >> q; for (int i = 1; i <= q; ++i) { int u; cin >> u; cout << (cost[nodeId[u]] >= inf ? -1 : cost[nodeId[u]]) << '\n'; } return 0; }