oj.uz

답안 #916822

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916822 2024-01-26T14:45:49 Z happypotato Long Mansion (JOI17_long_mansion) C++17
25 / 100
 988 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;
}
unordered_map<int, bool> sto[mxN];
bool recur(int x, int y) {
	// cout << x << ' ' << y << endl;
	if (sto[x].find(y) != sto[x].end()) return sto[x][y];
	sto[x][y] = false;
	if (x < y) {
		int req = querymin(x + 1, y);
		if (x <= req) { sto[x].erase(y); return true; }
		if (req == MIN) { sto[x].erase(y); return false; }
		return sto[x][y] = recur(x, req);
	} else if (x > y) {
		int req = querymax(y, x - 1);
		if (req <= x) { sto[x].erase(y); return true; }
		if (req == MAX) { sto[x].erase(y); return 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

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 45912 KB Output is correct
2 Correct 23 ms 46172 KB Output is correct
3 Correct 17 ms 46340 KB Output is correct
4 Correct 15 ms 45656 KB Output is correct
5 Correct 15 ms 45660 KB Output is correct
6 Correct 15 ms 45660 KB Output is correct
7 Correct 85 ms 62868 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 45912 KB Output is correct
2 Correct 23 ms 46172 KB Output is correct
3 Correct 17 ms 46340 KB Output is correct
4 Correct 15 ms 45656 KB Output is correct
5 Correct 15 ms 45660 KB Output is correct
6 Correct 15 ms 45660 KB Output is correct
7 Correct 85 ms 62868 KB Output is correct
8 Correct 490 ms 65812 KB Output is correct
9 Correct 525 ms 66288 KB Output is correct
10 Correct 444 ms 65668 KB Output is correct
11 Correct 417 ms 61808 KB Output is correct
12 Correct 264 ms 60068 KB Output is correct
13 Correct 154 ms 47668 KB Output is correct
14 Correct 146 ms 47648 KB Output is correct
15 Correct 109 ms 47916 KB Output is correct
16 Correct 161 ms 47716 KB Output is correct
17 Correct 134 ms 47852 KB Output is correct
18 Correct 131 ms 47516 KB Output is correct
19 Correct 137 ms 47700 KB Output is correct
20 Correct 114 ms 47696 KB Output is correct
21 Correct 128 ms 47680 KB Output is correct
22 Correct 143 ms 47696 KB Output is correct
23 Correct 200 ms 68432 KB Output is correct
24 Correct 201 ms 64592 KB Output is correct
25 Correct 205 ms 72016 KB Output is correct
26 Correct 172 ms 60756 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 608 ms 87396 KB Output is correct
2 Correct 604 ms 86052 KB Output is correct
3 Correct 595 ms 82756 KB Output is correct
4 Correct 591 ms 87384 KB Output is correct
5 Correct 567 ms 86980 KB Output is correct
6 Correct 287 ms 72788 KB Output is correct
7 Correct 253 ms 68176 KB Output is correct
8 Correct 279 ms 67060 KB Output is correct
9 Correct 259 ms 66948 KB Output is correct
10 Correct 264 ms 65820 KB Output is correct
11 Correct 223 ms 65612 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 45912 KB Output is correct
2 Correct 23 ms 46172 KB Output is correct
3 Correct 17 ms 46340 KB Output is correct
4 Correct 15 ms 45656 KB Output is correct
5 Correct 15 ms 45660 KB Output is correct
6 Correct 15 ms 45660 KB Output is correct
7 Correct 85 ms 62868 KB Output is correct
8 Correct 490 ms 65812 KB Output is correct
9 Correct 525 ms 66288 KB Output is correct
10 Correct 444 ms 65668 KB Output is correct
11 Correct 417 ms 61808 KB Output is correct
12 Correct 264 ms 60068 KB Output is correct
13 Correct 154 ms 47668 KB Output is correct
14 Correct 146 ms 47648 KB Output is correct
15 Correct 109 ms 47916 KB Output is correct
16 Correct 161 ms 47716 KB Output is correct
17 Correct 134 ms 47852 KB Output is correct
18 Correct 131 ms 47516 KB Output is correct
19 Correct 137 ms 47700 KB Output is correct
20 Correct 114 ms 47696 KB Output is correct
21 Correct 128 ms 47680 KB Output is correct
22 Correct 143 ms 47696 KB Output is correct
23 Correct 200 ms 68432 KB Output is correct
24 Correct 201 ms 64592 KB Output is correct
25 Correct 205 ms 72016 KB Output is correct
26 Correct 172 ms 60756 KB Output is correct
27 Correct 608 ms 87396 KB Output is correct
28 Correct 604 ms 86052 KB Output is correct
29 Correct 595 ms 82756 KB Output is correct
30 Correct 591 ms 87384 KB Output is correct
31 Correct 567 ms 86980 KB Output is correct
32 Correct 287 ms 72788 KB Output is correct
33 Correct 253 ms 68176 KB Output is correct
34 Correct 279 ms 67060 KB Output is correct
35 Correct 259 ms 66948 KB Output is correct
36 Correct 264 ms 65820 KB Output is correct
37 Correct 223 ms 65612 KB Output is correct
38 Correct 764 ms 122424 KB Output is correct
39 Correct 872 ms 141816 KB Output is correct
40 Correct 795 ms 122684 KB Output is correct
41 Correct 746 ms 126884 KB Output is correct
42 Correct 258 ms 65384 KB Output is correct
43 Correct 265 ms 66384 KB Output is correct
44 Correct 341 ms 73724 KB Output is correct
45 Correct 310 ms 73044 KB Output is correct
46 Correct 323 ms 72904 KB Output is correct
47 Correct 261 ms 65616 KB Output is correct
48 Correct 308 ms 73348 KB Output is correct
49 Correct 383 ms 80268 KB Output is correct
50 Correct 341 ms 74700 KB Output is correct
51 Correct 329 ms 72420 KB Output is correct
52 Runtime error 988 ms 262144 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -