제출 #429787

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
429787		Kevin_Zhang_TW	Long Mansion (JOI17_long_mansion)	C++17	100 / 100	443 ms	53568 KiB

long_mansion

#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;
}

struct sgt {
	struct node {
		int mn, mx;
		node (int a, int b) : mn(a), mx(b) {}
		node (int v = 0) : mn(v), mx(v) {}
		node (node a, node b) :
			mn(min(a.mn, b.mn)), mx(max(a.mx, b.mx)) {}
	};
	int n;
	vector<node> val;
	sgt(int n) : n(n) {
		val.resize(n<<1);
	}
	void modify(int i, int l, int r) {
		i += n;
		val[i] = node(l, r);
		while (i>>=1) 
			val[i] = node(val[i<<1], val[i<<1|1]);
	}
	node qry(int l, int r) {
		l += n, r += n;
		node ret(n + 10, -10);
		for (;l < r;l>>=1, r>>=1) {
			if (l&1) ret = node(ret, val[l++]);
			if (r&1) ret = node(ret, val[--r]);
		}
		return ret;
	}
}tree(0);
void upd(int &l, int &r) {
	auto [mn, mx] = tree.qry(l, r+1);
	chmin(l, mn);
	chmax(r, mx);
}

void init() {
	init_lrn();

	tree = sgt(n + 1);

	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] >= i) {
			++r;
			chmax(r, rgo[r]);
		}
	}
	for (int i = 1;i <= n;++i) 
		tree.modify(i, lgo[i], rgo[i]);

	for (int i = 1;i <= n;++i) {
		int &l = lgo[i], &r = rgo[i];
		assert(l >= 1 && r <= n);
		while (rn[l-1] <= r || ln[r] >= l) {
			if (rn[l-1] <= r) --l;
			if (ln[r] >= l) ++r;
			upd(l, r);
		}
		tree.modify(i, l, 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';
		}
	}
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 75 / 75