oj.uz

Submission #916800

# Submission time Handle Problem Language Result Execution time Memory
916800 2024-01-26T14:36:32 Z happypotato Long Mansion (JOI17_long_mansion) C++17
25 / 100
 2572 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
const int mxN = 5e5 + 1;
const int MAX = 1e9, MIN = -1e9;
pii seg[(1 << 20)];
pii a[mxN];
int corr[mxN];
vector<int> keys[mxN];
int n;
void build(int l = 1, int r = n, int idx = 1) {
	if (l == r) {
		seg[idx] = a[l];
		return;
	}
	int mid = (l + r) >> 1;
	build(l, mid, (idx << 1));
	build(mid + 1, r, (idx << 1) | 1);
	seg[idx].ff = min(seg[(idx << 1)].ff, seg[(idx << 1) | 1].ff);
	seg[idx].ss = max(seg[(idx << 1)].ss, seg[(idx << 1) | 1].ss);
}
int querymin(int tl, int tr, int l = 1, int r = n, int idx = 1) {
	if (tl <= l && r <= tr) return seg[idx].ff;
	int mid = (l + r) >> 1;
	int res = MAX;
	if (tl <= mid) res = min(res, querymin(tl, tr, l, mid, (idx << 1)));
	if (tr > mid) res = min(res, querymin(tl, tr, mid + 1, r, (idx << 1) | 1));
	return res;
}
int querymax(int tl, int tr, int l = 1, int r = n, int idx = 1) {
	if (tl <= l && r <= tr) return seg[idx].ss;
	int mid = (l + r) >> 1;
	int res = MIN;
	if (tl <= mid) res = max(res, querymax(tl, tr, l, mid, (idx << 1)));
	if (tr > mid) res = max(res, querymax(tl, tr, mid + 1, r, (idx << 1) | 1));
	return res;
}
map<pii, bool> sto;
bool recur(int x, int y) {
	// cout << x << ' ' << y << endl;
	if (sto.find({x, y}) != sto.end()) return sto[{x, y}];
	sto[{x, y}] = false;
	if (x < y) {
		int req = querymin(x + 1, y);
		if (x <= req) return sto[{x, y}] = true;
		if (req == MIN) return sto[{x, y}] = false;
		return sto[{x, y}] = recur(x, req);
	} else if (x > y) {
		int req = querymax(y, x - 1);
		if (req <= x) return sto[{x, y}] = true;
		if (req == MAX) return sto[{x, y}] = false;
		return sto[{x, y}] = recur(x, req);
	} else return true;
}
int occur[mxN];
void solve() {
	cin >> n;
	for (int i = 1; i < n; i++) cin >> corr[i];
	for (int i = 1; i <= n; i++) {
		int sz; cin >> sz;
		keys[i].resize(sz);
		for (int &x : keys[i]) cin >> x;
	}

	// sweep from left to right, take min of max
	for (int i = 1; i <= n; i++) occur[i] = MIN;
	a[1].ff = MIN;
	for (int i = 1; i < n; i++) {
		for (int x : keys[i]) occur[x] = i;
		a[i + 1].ff = occur[corr[i]];
	}
	// sweep from right to left, take max of min
	for (int i = 1; i <= n; i++) occur[i] = MAX;
	a[n].ss = MAX;
	for (int i = n; i > 1; i--) {
		for (int x : keys[i]) occur[x] = i;
		a[i - 1].ss = occur[corr[i - 1]];
	}

	// for (int i = 1; i <= n; i++) {
	// 	cout << i << ": " << a[i].ff << ' ' << a[i].ss << endl;
	// }
	build();

	int q; cin >> q;
	while (q--) {
		int x, y;
		cin >> x >> y;
		cout << (recur(x, y) ? "YES\n" : "NO\n");
	}
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19544 KB Output is correct
2 Correct 14 ms 19804 KB Output is correct
3 Correct 11 ms 19548 KB Output is correct
4 Correct 9 ms 19288 KB Output is correct
5 Correct 8 ms 19292 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 172 ms 43408 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19544 KB Output is correct
2 Correct 14 ms 19804 KB Output is correct
3 Correct 11 ms 19548 KB Output is correct
4 Correct 9 ms 19288 KB Output is correct
5 Correct 8 ms 19292 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 172 ms 43408 KB Output is correct
8 Correct 858 ms 54448 KB Output is correct
9 Correct 732 ms 54612 KB Output is correct
10 Correct 744 ms 55952 KB Output is correct
11 Correct 806 ms 57004 KB Output is correct
12 Correct 679 ms 49024 KB Output is correct
13 Correct 170 ms 25748 KB Output is correct
14 Correct 146 ms 25684 KB Output is correct
15 Correct 154 ms 25792 KB Output is correct
16 Correct 151 ms 25056 KB Output is correct
17 Correct 159 ms 25940 KB Output is correct
18 Correct 152 ms 25760 KB Output is correct
19 Correct 146 ms 25584 KB Output is correct
20 Correct 153 ms 25496 KB Output is correct
21 Correct 152 ms 25224 KB Output is correct
22 Correct 149 ms 25452 KB Output is correct
23 Correct 393 ms 52484 KB Output is correct
24 Correct 383 ms 52508 KB Output is correct
25 Correct 441 ms 59820 KB Output is correct
26 Correct 312 ms 45344 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1318 ms 77784 KB Output is correct
2 Correct 1385 ms 77060 KB Output is correct
3 Correct 1225 ms 74544 KB Output is correct
4 Correct 1309 ms 78044 KB Output is correct
5 Correct 1307 ms 77548 KB Output is correct
6 Correct 535 ms 58192 KB Output is correct
7 Correct 427 ms 49492 KB Output is correct
8 Correct 416 ms 47380 KB Output is correct
9 Correct 384 ms 47832 KB Output is correct
10 Correct 335 ms 45140 KB Output is correct
11 Correct 364 ms 45140 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19544 KB Output is correct
2 Correct 14 ms 19804 KB Output is correct
3 Correct 11 ms 19548 KB Output is correct
4 Correct 9 ms 19288 KB Output is correct
5 Correct 8 ms 19292 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 172 ms 43408 KB Output is correct
8 Correct 858 ms 54448 KB Output is correct
9 Correct 732 ms 54612 KB Output is correct
10 Correct 744 ms 55952 KB Output is correct
11 Correct 806 ms 57004 KB Output is correct
12 Correct 679 ms 49024 KB Output is correct
13 Correct 170 ms 25748 KB Output is correct
14 Correct 146 ms 25684 KB Output is correct
15 Correct 154 ms 25792 KB Output is correct
16 Correct 151 ms 25056 KB Output is correct
17 Correct 159 ms 25940 KB Output is correct
18 Correct 152 ms 25760 KB Output is correct
19 Correct 146 ms 25584 KB Output is correct
20 Correct 153 ms 25496 KB Output is correct
21 Correct 152 ms 25224 KB Output is correct
22 Correct 149 ms 25452 KB Output is correct
23 Correct 393 ms 52484 KB Output is correct
24 Correct 383 ms 52508 KB Output is correct
25 Correct 441 ms 59820 KB Output is correct
26 Correct 312 ms 45344 KB Output is correct
27 Correct 1318 ms 77784 KB Output is correct
28 Correct 1385 ms 77060 KB Output is correct
29 Correct 1225 ms 74544 KB Output is correct
30 Correct 1309 ms 78044 KB Output is correct
31 Correct 1307 ms 77548 KB Output is correct
32 Correct 535 ms 58192 KB Output is correct
33 Correct 427 ms 49492 KB Output is correct
34 Correct 416 ms 47380 KB Output is correct
35 Correct 384 ms 47832 KB Output is correct
36 Correct 335 ms 45140 KB Output is correct
37 Correct 364 ms 45140 KB Output is correct
38 Correct 1590 ms 109092 KB Output is correct
39 Correct 1921 ms 126556 KB Output is correct
40 Correct 1749 ms 109852 KB Output is correct
41 Correct 1597 ms 109444 KB Output is correct
42 Correct 462 ms 55900 KB Output is correct
43 Correct 551 ms 58472 KB Output is correct
44 Correct 561 ms 73088 KB Output is correct
45 Correct 569 ms 72504 KB Output is correct
46 Correct 578 ms 71908 KB Output is correct
47 Correct 420 ms 53716 KB Output is correct
48 Correct 580 ms 62780 KB Output is correct
49 Correct 778 ms 81000 KB Output is correct
50 Correct 576 ms 73552 KB Output is correct
51 Correct 536 ms 70844 KB Output is correct
52 Runtime error 2572 ms 262144 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -