#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
// My bug list :
// integer overflow
// 0based, 1based forgotten
// index out of bound
// n, m, i, j typo
// some cases are missing
const int MAX_N = 500010;
int n, req[MAX_N], ln[MAX_N], rn[MAX_N], lgo[MAX_N], rgo[MAX_N];
vector<int> key[MAX_N];
void init_lrn() {
vector<int> at(n + 10);
for (int i = 1;i < n;++i) {
for (int j : key[i]) at[j] = i;
ln[i] = at[req[i]];
}
fill(AI(at), n + 1);
for (int i = n-1;i >= 1;--i) {
for (int j : key[i+1]) at[j] = i+1;
rn[i] = at[req[i]];
}
rn[0] = n+1;
ln[n+1] = 0;
}
void init() {
init_lrn();
for (int i = 1;i <= n;++i) {
lgo[i] = rgo[i] = i;
}
for (int i = 1;i <= n;++i) {
int &l = lgo[i];
while (rn[l-1] <= i) {
--l;
chmin(l, lgo[l]);
}
}
for (int i = n;i >= 1;--i) {
int &r = rgo[i];
while (ln[r+1] >= i) {
++r;
chmax(r, rgo[r]);
}
}
for (int i = 1;i <= n;++i) {
int &l = lgo[i], &r = rgo[i];
while (rn[l-1] <= i || ln[r+1] >= i) {
while (rn[l-1] <= i) {
--l;
chmin(l, lgo[l]);
}
while (ln[r+1] >= i) {
++r;
chmax(r, rgo[r]);
}
}
}
}
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n;
for (int i = 1;i < n;++i) cin >> req[i];
for (int i = 1, sz;i <= n;++i) {
cin >> sz;
key[i].resize(sz);
for (int &j : key[i]) cin >> j;
}
init();
int q;
cin >> q;
#define yn(i) ((i) ? "YES" : "NO")
while (q--) {
int x, y;
cin >> x >> y;
if (x < y) {
cout << yn(rgo[x] >= y) << '\n';
}
else {
cout << yn(lgo[x] <= y) << '\n';
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
12108 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
12108 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
206 ms |
18816 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
12108 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
