oj.uz

답안 #429770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
429770 2021-06-16T09:26:35 Z Kevin_Zhang_TW Long Mansion (JOI17_long_mansion) C++17
25 / 100
 3000 ms 50424 KB 
#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 upd(int &l, int &r) {
	chmin(l, min(lgo[l], lgo[r]));
	chmax(r, max(rgo[l], rgo[r]));
}
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] >= i) {
			++r;
			chmax(r, rgo[r]);
		}
	}
	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) {
			while (rn[l-1] <= r) --l;
			while (ln[r] >= l) ++r;
			upd(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.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12108 KB Output is correct
2 Correct 11 ms 12236 KB Output is correct
3 Correct 13 ms 12360 KB Output is correct
4 Correct 10 ms 12120 KB Output is correct
5 Correct 10 ms 12220 KB Output is correct
6 Correct 10 ms 12108 KB Output is correct
7 Correct 11 ms 12192 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12108 KB Output is correct
2 Correct 11 ms 12236 KB Output is correct
3 Correct 13 ms 12360 KB Output is correct
4 Correct 10 ms 12120 KB Output is correct
5 Correct 10 ms 12220 KB Output is correct
6 Correct 10 ms 12108 KB Output is correct
7 Correct 11 ms 12192 KB Output is correct
8 Correct 136 ms 13620 KB Output is correct
9 Correct 139 ms 13600 KB Output is correct
10 Correct 150 ms 13892 KB Output is correct
11 Correct 138 ms 14104 KB Output is correct
12 Correct 134 ms 13780 KB Output is correct
13 Correct 152 ms 13912 KB Output is correct
14 Correct 134 ms 13892 KB Output is correct
15 Correct 133 ms 13964 KB Output is correct
16 Correct 133 ms 14148 KB Output is correct
17 Correct 140 ms 14020 KB Output is correct
18 Correct 131 ms 13888 KB Output is correct
19 Correct 136 ms 13836 KB Output is correct
20 Correct 142 ms 14080 KB Output is correct
21 Correct 131 ms 14184 KB Output is correct
22 Correct 132 ms 13928 KB Output is correct
23 Correct 136 ms 13760 KB Output is correct
24 Correct 147 ms 13788 KB Output is correct
25 Correct 145 ms 13776 KB Output is correct
26 Correct 139 ms 13684 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 598 ms 18856 KB Output is correct
2 Correct 920 ms 18840 KB Output is correct
3 Correct 1384 ms 24512 KB Output is correct
4 Correct 702 ms 26160 KB Output is correct
5 Correct 749 ms 26032 KB Output is correct
6 Correct 1770 ms 25340 KB Output is correct
7 Correct 2031 ms 25232 KB Output is correct
8 Correct 1474 ms 25084 KB Output is correct
9 Correct 1470 ms 25204 KB Output is correct
10 Correct 777 ms 25128 KB Output is correct
11 Correct 767 ms 25188 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12108 KB Output is correct
2 Correct 11 ms 12236 KB Output is correct
3 Correct 13 ms 12360 KB Output is correct
4 Correct 10 ms 12120 KB Output is correct
5 Correct 10 ms 12220 KB Output is correct
6 Correct 10 ms 12108 KB Output is correct
7 Correct 11 ms 12192 KB Output is correct
8 Correct 136 ms 13620 KB Output is correct
9 Correct 139 ms 13600 KB Output is correct
10 Correct 150 ms 13892 KB Output is correct
11 Correct 138 ms 14104 KB Output is correct
12 Correct 134 ms 13780 KB Output is correct
13 Correct 152 ms 13912 KB Output is correct
14 Correct 134 ms 13892 KB Output is correct
15 Correct 133 ms 13964 KB Output is correct
16 Correct 133 ms 14148 KB Output is correct
17 Correct 140 ms 14020 KB Output is correct
18 Correct 131 ms 13888 KB Output is correct
19 Correct 136 ms 13836 KB Output is correct
20 Correct 142 ms 14080 KB Output is correct
21 Correct 131 ms 14184 KB Output is correct
22 Correct 132 ms 13928 KB Output is correct
23 Correct 136 ms 13760 KB Output is correct
24 Correct 147 ms 13788 KB Output is correct
25 Correct 145 ms 13776 KB Output is correct
26 Correct 139 ms 13684 KB Output is correct
27 Correct 598 ms 18856 KB Output is correct
28 Correct 920 ms 18840 KB Output is correct
29 Correct 1384 ms 24512 KB Output is correct
30 Correct 702 ms 26160 KB Output is correct
31 Correct 749 ms 26032 KB Output is correct
32 Correct 1770 ms 25340 KB Output is correct
33 Correct 2031 ms 25232 KB Output is correct
34 Correct 1474 ms 25084 KB Output is correct
35 Correct 1470 ms 25204 KB Output is correct
36 Correct 777 ms 25128 KB Output is correct
37 Correct 767 ms 25188 KB Output is correct
38 Correct 354 ms 45560 KB Output is correct
39 Correct 385 ms 50424 KB Output is correct
40 Correct 292 ms 39312 KB Output is correct
41 Execution timed out 3041 ms 40568 KB Time limit exceeded
42 Halted 0 ms 0 KB -