#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; //ll mod = 1; constexpr ll mod = 998244353; //constexpr ll mod = 1000000007; const int mod17 = 1000000007; const ll INF = mod * mod; typedef pairP; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; using ld = long double; typedef pair LDP; const ld eps = 1e-10; const ld pi = acosl(-1.0); template void chmin(T& a, T b) { a = min(a, b); } template void chmax(T& a, T b) { a = max(a, b); } template vector vmerge(vector& a, vector& b) { vector res; int ida = 0, idb = 0; while (ida < a.size() || idb < b.size()) { if (idb == b.size()) { res.push_back(a[ida]); ida++; } else if (ida == a.size()) { res.push_back(b[idb]); idb++; } else { if (a[ida] < b[idb]) { res.push_back(a[ida]); ida++; } else { res.push_back(b[idb]); idb++; } } } return res; } template void cinarray(vector& v) { rep(i, v.size())cin >> v[i]; } template void coutarray(vector& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; //if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } //mod should be <2^31 struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } bool operator<(modint a, modint b) { return a.n < b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } template void addv(vector& v, int loc, T val) { if (loc >= v.size())v.resize(loc + 1, 0); v[loc] += val; } /*const int mn = 2000005; bool isp[mn]; vector ps; void init() { fill(isp + 2, isp + mn, true); for (int i = 2; i < mn; i++) { if (!isp[i])continue; ps.push_back(i); for (int j = 2 * i; j < mn; j += i) { isp[j] = false; } } }*/ //[,val) template auto prev_itr(set& st, T val) { auto res = st.lower_bound(val); if (res == st.begin())return st.end(); res--; return res; } //[val,) template auto next_itr(set& st, T val) { auto res = st.lower_bound(val); return res; } using mP = pair; mP operator+(mP a, mP b) { return { a.first + b.first,a.second + b.second }; } mP operator+=(mP& a, mP b) { a = a + b; return a; } mP operator-(mP a, mP b) { return { a.first - b.first,a.second - b.second }; } mP operator-=(mP& a, mP b) { a = a - b; return a; } LP operator+(LP a, LP b) { return { a.first + b.first,a.second + b.second }; } LP operator+=(LP& a, LP b) { a = a + b; return a; } LP operator-(LP a, LP b) { return { a.first - b.first,a.second - b.second }; } LP operator-=(LP& a, LP b) { a = a - b; return a; } mt19937 mt(time(0)); const string drul = "DRUL"; string senw = "SENW"; //DRUL,or SENW //int dx[4] = { 1,0,-1,0 }; //int dy[4] = { 0,1,0,-1 }; //----------------------------------------- template struct BIT { private: vector node; int n; public: BIT(int n_) { n = n_; node.resize(n, 0); } //0-indexed void add(int a, T w) { for (int i = a; i < n; i |= i + 1)node[i] += w; } //[0,a) T sum(int a) { T ret = 0; for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i]; return ret; } //[a,b) T sum(int a, int b) { return sum(b) - sum(a); } }; struct BITx { private: vector node; int n; public: BITx(int n_) { n = n_; node.resize(n, 0); } //0-indexed void add(int a, ll w) { for (int i = a; i < n; i |= i + 1)node[i] ^= w; } //[0,a) ll sum(int a) { ll ret = 0; for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret ^= node[i]; return ret; } //[a,b) ll sum(int a, int b) { return sum(b) ^ sum(a); } }; const int bl = 300; struct Data { int lx, rx, ly, ry; }; bool operator<(Data a, Data b) { if (a.ly != b.ly)return a.ly < b.ly; return a.ry < b.ry; } void solve() { int n; cin >> n; vector h(n); rep(i, n)cin >> h[i]; vector> vd(n); rep(i, n) { int a, b, c, d, e; cin >> a >> b >> c >> d >> e; e--; vd[e].push_back({ a,c,b,d }); } rep(i, n)sort(all(vd[i])); int q; cin >> q; vector x(q), y(q); rep(i, q)cin >> x[i] >> y[i]; vector> qs(2 * n); rep(i, q) { qs[x[i]].push_back(i); } using ar = array; vector> ads(2 * n); vector ans(q); BIT btcnt(2 * n); rep(i, n)if (vd[i].size() >= bl) { rep(i, 2 * n)ads[i].clear(); for (Data d : vd[i]) { ads[d.lx].push_back({d.ly,d.ry,1}); ads[d.rx].push_back({ d.ly,d.ry,-1 }); } rep(j, 2 * n) { for (auto a : ads[j]) { btcnt.add(a[0], a[2]); btcnt.add(a[1], -a[2]); } for (int qid : qs[j]) { int c = btcnt.sum(y[qid] + 1); if (c>0)ans[qid] ^= h[i]; } } } vector> segs(n); BITx bt(2 * n); auto upd = [&](int id, int x) { for (auto p : segs[id]) { bt.add(p.first, h[id]); bt.add(p.second, h[id]); } segs[id].clear(); for (auto d : vd[id]) { if (d.lx <= x && x < d.rx) { if (segs[id].size() && segs[id].back().second >= d.ly) { chmax(segs[id].back().second, d.ry); } else { segs[id].push_back({ d.ly,d.ry }); } } } for (auto p : segs[id]) { bt.add(p.first, h[id]); bt.add(p.second, h[id]); } }; vector> upds(2 * n); rep(i, n)if (vd[i].size() < bl) { for (auto d : vd[i]) { upds[d.lx].push_back(i); upds[d.rx].push_back(i); } } rep(i, 2 * n) { sort(all(upds[i])); upds[i].erase(unique(all(upds[i])), upds[i].end()); for (int id : upds[i]) { upd(id,i); } for (int qid : qs[i]) { ll val = bt.sum(y[qid] + 1); ans[qid] ^= val; } } rep(i, q)cout << ans[i] << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //init(); //while(true) //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }