oj.uz

답안 #429542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
429542 2021-06-16T05:51:19 Z Kevin_Zhang_TW Long Mansion (JOI17_long_mansion) C++17
10 / 100
 3000 ms 26196 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 init() {
	init_lrn();
	for (int i = 1;i <= n;++i) {
		lgo[i] = rgo[i] = i;
		int &l = lgo[i], &r = rgo[i];
		while (true) {
			bool exp = false;
			if (rn[l-1] <= r) --l, exp = true;
			if (ln[r] >= l) ++r, exp = true;
			if (!exp) break;
		}
	}
}
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 12 ms 12236 KB Output is correct
2 Correct 13 ms 12300 KB Output is correct
3 Correct 22 ms 12416 KB Output is correct
4 Correct 12 ms 12236 KB Output is correct
5 Correct 14 ms 12236 KB Output is correct
6 Correct 12 ms 12284 KB Output is correct
7 Correct 11 ms 12196 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12236 KB Output is correct
2 Correct 13 ms 12300 KB Output is correct
3 Correct 22 ms 12416 KB Output is correct
4 Correct 12 ms 12236 KB Output is correct
5 Correct 14 ms 12236 KB Output is correct
6 Correct 12 ms 12284 KB Output is correct
7 Correct 11 ms 12196 KB Output is correct
8 Correct 152 ms 18108 KB Output is correct
9 Correct 143 ms 18000 KB Output is correct
10 Correct 140 ms 18500 KB Output is correct
11 Correct 158 ms 18816 KB Output is correct
12 Correct 168 ms 17604 KB Output is correct
13 Correct 139 ms 18228 KB Output is correct
14 Correct 146 ms 18232 KB Output is correct
15 Correct 139 ms 18212 KB Output is correct
16 Correct 141 ms 18072 KB Output is correct
17 Correct 148 ms 18188 KB Output is correct
18 Correct 137 ms 18244 KB Output is correct
19 Correct 175 ms 18216 KB Output is correct
20 Correct 143 ms 18244 KB Output is correct
21 Correct 137 ms 18004 KB Output is correct
22 Correct 136 ms 18136 KB Output is correct
23 Correct 137 ms 18104 KB Output is correct
24 Correct 158 ms 17988 KB Output is correct
25 Correct 140 ms 18064 KB Output is correct
26 Correct 141 ms 18016 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 880 ms 26196 KB Output is correct
2 Correct 1678 ms 26100 KB Output is correct
3 Execution timed out 3032 ms 18748 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12236 KB Output is correct
2 Correct 13 ms 12300 KB Output is correct
3 Correct 22 ms 12416 KB Output is correct
4 Correct 12 ms 12236 KB Output is correct
5 Correct 14 ms 12236 KB Output is correct
6 Correct 12 ms 12284 KB Output is correct
7 Correct 11 ms 12196 KB Output is correct
8 Correct 152 ms 18108 KB Output is correct
9 Correct 143 ms 18000 KB Output is correct
10 Correct 140 ms 18500 KB Output is correct
11 Correct 158 ms 18816 KB Output is correct
12 Correct 168 ms 17604 KB Output is correct
13 Correct 139 ms 18228 KB Output is correct
14 Correct 146 ms 18232 KB Output is correct
15 Correct 139 ms 18212 KB Output is correct
16 Correct 141 ms 18072 KB Output is correct
17 Correct 148 ms 18188 KB Output is correct
18 Correct 137 ms 18244 KB Output is correct
19 Correct 175 ms 18216 KB Output is correct
20 Correct 143 ms 18244 KB Output is correct
21 Correct 137 ms 18004 KB Output is correct
22 Correct 136 ms 18136 KB Output is correct
23 Correct 137 ms 18104 KB Output is correct
24 Correct 158 ms 17988 KB Output is correct
25 Correct 140 ms 18064 KB Output is correct
26 Correct 141 ms 18016 KB Output is correct
27 Correct 880 ms 26196 KB Output is correct
28 Correct 1678 ms 26100 KB Output is correct
29 Execution timed out 3032 ms 18748 KB Time limit exceeded
30 Halted 0 ms 0 KB -