oj.uz

답안 #884976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884976 2023-12-08T18:35:50 Z MinaRagy06 Jail (JOI22_jail) C++17
61 / 100
 5000 ms 26856 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 120'005;
vector<int> adj[N];
int st[N], en[N], h[N], anc[N][17], t;
void dfs(int i, int par, int d = 0) {
	anc[i][0] = par;
	for (int j = 1; j < 17; j++) {
		anc[i][j] = anc[anc[i][j - 1]][j - 1];
	}
	h[i] = d;
	st[i] = t++;
	for (auto nxt : adj[i]) {
		if (nxt == par) continue;
		dfs(nxt, i, d + 1);
	}
	en[i] = t - 1;
}
int getlca(int u, int v) {
	if (st[u] <= st[v] && en[v] <= en[u]) {
		return u;
	}
	for (int j = 16; j >= 0; j--) {
		int nxtu = anc[u][j];
		if (!(st[nxtu] <= st[v] && en[v] <= en[nxtu])) {
			u = nxtu;
		}
	}
	return anc[u][0];
}
struct path {
	int s, e, lca;
} a[N];
int m;
bool vis[N], instack[N];
bool dfs2(int i) {
	vis[i] = 1;
	instack[i] = 1;
	bool ok = 1;
// 	cout << i + 1 << '\n';
	for (int j = 0; j < m; j++) {
		if (j == i) continue;
		bool gud = st[a[i].lca] <= st[a[j].s] && en[a[j].s] <= en[a[i].lca] &&
			st[a[j].s] <= st[a[i].s] && en[a[i].s] <= en[a[j].s];
		gud |= st[a[i].lca] <= st[a[j].s] && en[a[j].s] <= en[a[i].lca] &&
			st[a[j].s] <= st[a[i].e] && en[a[i].e] <= en[a[j].s];
		
		gud |= st[a[j].lca] <= st[a[i].e] && en[a[i].e] <= en[a[j].lca] && 
			st[a[i].e] <= st[a[j].s] && en[a[j].s] <= en[a[i].e];
		gud |= st[a[j].lca] <= st[a[i].e] && en[a[i].e] <= en[a[j].lca] && 
			st[a[i].e] <= st[a[j].e] && en[a[j].e] <= en[a[i].e];
		if (gud) {
			if (instack[j]) {
				ok = 0;
				break;
			}
			if (vis[j]) continue;
			if (!dfs2(j)) {
				ok = 0;
				break;
			}
		}
	}
	instack[i] = 0;
	return ok;
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int T;
	cin >> T;
	while (T--) {
		int n;
		cin >> n;
		for (int i = 0; i < n; i++) {
			adj[i].clear();
			vis[i] = 0;
			instack[i] = 0;
		}
		for (int i = 1, u, v; i < n; i++) {
			cin >> u >> v;
			u--, v--;
			adj[u].push_back(v);
			adj[v].push_back(u);
		}
		t = 0;
		dfs(0, 0);
		cin >> m;
		for (int i = 0; i < m; i++) {
			cin >> a[i].s >> a[i].e;
			a[i].s--, a[i].e--;
			a[i].lca = getlca(a[i].s, a[i].e);
// 			cout << a[i].s + 1 << ' ' << a[i].e + 1 << ' ' << a[i].lca + 1 << '\n';
		}
		auto check = [&] (int i, int x) {
			if (st[a[i].lca] <= st[x] && en[x] <= en[a[i].lca] && 
				((st[x] <= st[a[i].s] && en[a[i].s] <= en[x]) ||
				(st[x] <= st[a[i].e] && en[a[i].e] <= en[x]))) {
				return 1;
			}
			return 0;
		};
		bool ok = 1;
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < m; j++) {
				if (i == j) continue;
				if (check(i, a[j].s) && check(i, a[j].e)) {
					ok = 0;
					break;
				}
			}
		}
		for (int i = 0; i < m; i++) {
			if (vis[i]) continue;
			if (!dfs2(i)) {
				ok = 0;
			}
		}
		cout << (ok? "Yes\n" : "No\n");
	}
	return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 14 ms 7772 KB Output is correct
5 Correct 18 ms 7988 KB Output is correct
6 Correct 2 ms 7772 KB Output is correct
7 Correct 2 ms 7772 KB Output is correct
8 Correct 4 ms 7772 KB Output is correct
9 Correct 47 ms 8540 KB Output is correct
10 Correct 40 ms 25684 KB Output is correct
11 Correct 6 ms 7768 KB Output is correct
12 Correct 37 ms 7772 KB Output is correct
13 Execution timed out 5087 ms 25480 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 3 ms 7772 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 2 ms 8028 KB Output is correct
7 Correct 2 ms 7984 KB Output is correct
8 Correct 3 ms 7968 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 2 ms 8024 KB Output is correct
11 Correct 3 ms 8024 KB Output is correct
12 Correct 2 ms 7772 KB Output is correct
13 Correct 2 ms 7772 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 3 ms 7772 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 2 ms 8028 KB Output is correct
7 Correct 2 ms 7984 KB Output is correct
8 Correct 3 ms 7968 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 2 ms 8024 KB Output is correct
11 Correct 3 ms 8024 KB Output is correct
12 Correct 2 ms 7772 KB Output is correct
13 Correct 2 ms 7772 KB Output is correct
14 Correct 2 ms 7772 KB Output is correct
15 Correct 2 ms 7772 KB Output is correct
16 Correct 2 ms 7856 KB Output is correct
17 Correct 3 ms 8028 KB Output is correct
18 Correct 2 ms 8024 KB Output is correct
19 Correct 2 ms 7772 KB Output is correct
20 Correct 3 ms 8028 KB Output is correct
21 Correct 2 ms 7988 KB Output is correct
22 Correct 3 ms 8028 KB Output is correct
23 Correct 2 ms 7772 KB Output is correct
24 Correct 2 ms 7768 KB Output is correct
25 Correct 3 ms 7768 KB Output is correct
26 Correct 2 ms 7772 KB Output is correct
27 Correct 2 ms 8028 KB Output is correct
28 Correct 2 ms 7772 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 3 ms 7772 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 2 ms 8028 KB Output is correct
7 Correct 2 ms 7984 KB Output is correct
8 Correct 3 ms 7968 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 2 ms 8024 KB Output is correct
11 Correct 3 ms 8024 KB Output is correct
12 Correct 2 ms 7772 KB Output is correct
13 Correct 2 ms 7772 KB Output is correct
14 Correct 2 ms 7772 KB Output is correct
15 Correct 2 ms 7772 KB Output is correct
16 Correct 2 ms 7856 KB Output is correct
17 Correct 3 ms 8028 KB Output is correct
18 Correct 2 ms 8024 KB Output is correct
19 Correct 2 ms 7772 KB Output is correct
20 Correct 3 ms 8028 KB Output is correct
21 Correct 2 ms 7988 KB Output is correct
22 Correct 3 ms 8028 KB Output is correct
23 Correct 2 ms 7772 KB Output is correct
24 Correct 2 ms 7768 KB Output is correct
25 Correct 3 ms 7768 KB Output is correct
26 Correct 2 ms 7772 KB Output is correct
27 Correct 2 ms 8028 KB Output is correct
28 Correct 2 ms 7772 KB Output is correct
29 Correct 4 ms 8028 KB Output is correct
30 Correct 4 ms 7808 KB Output is correct
31 Correct 4 ms 8028 KB Output is correct
32 Correct 4 ms 8028 KB Output is correct
33 Correct 3 ms 8028 KB Output is correct
34 Correct 4 ms 8032 KB Output is correct
35 Correct 4 ms 8024 KB Output is correct
36 Correct 6 ms 8028 KB Output is correct
37 Correct 4 ms 7868 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 3 ms 7772 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 2 ms 8028 KB Output is correct
7 Correct 2 ms 7984 KB Output is correct
8 Correct 3 ms 7968 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 2 ms 8024 KB Output is correct
11 Correct 3 ms 8024 KB Output is correct
12 Correct 2 ms 7772 KB Output is correct
13 Correct 2 ms 7772 KB Output is correct
14 Correct 2 ms 7772 KB Output is correct
15 Correct 2 ms 7772 KB Output is correct
16 Correct 2 ms 7856 KB Output is correct
17 Correct 3 ms 8028 KB Output is correct
18 Correct 2 ms 8024 KB Output is correct
19 Correct 2 ms 7772 KB Output is correct
20 Correct 3 ms 8028 KB Output is correct
21 Correct 2 ms 7988 KB Output is correct
22 Correct 3 ms 8028 KB Output is correct
23 Correct 2 ms 7772 KB Output is correct
24 Correct 2 ms 7768 KB Output is correct
25 Correct 3 ms 7768 KB Output is correct
26 Correct 2 ms 7772 KB Output is correct
27 Correct 2 ms 8028 KB Output is correct
28 Correct 2 ms 7772 KB Output is correct
29 Correct 4 ms 8028 KB Output is correct
30 Correct 4 ms 7808 KB Output is correct
31 Correct 4 ms 8028 KB Output is correct
32 Correct 4 ms 8028 KB Output is correct
33 Correct 3 ms 8028 KB Output is correct
34 Correct 4 ms 8032 KB Output is correct
35 Correct 4 ms 8024 KB Output is correct
36 Correct 6 ms 8028 KB Output is correct
37 Correct 4 ms 7868 KB Output is correct
38 Correct 46 ms 9556 KB Output is correct
39 Correct 41 ms 26856 KB Output is correct
40 Correct 100 ms 9348 KB Output is correct
41 Correct 122 ms 9296 KB Output is correct
42 Correct 100 ms 9660 KB Output is correct
43 Correct 23 ms 9304 KB Output is correct
44 Correct 39 ms 8024 KB Output is correct
45 Correct 57 ms 19280 KB Output is correct
46 Correct 46 ms 19276 KB Output is correct
47 Correct 41 ms 23128 KB Output is correct
48 Correct 41 ms 23092 KB Output is correct
49 Correct 44 ms 19548 KB Output is correct
50 Correct 46 ms 19452 KB Output is correct
51 Correct 42 ms 20768 KB Output is correct
52 Correct 36 ms 20500 KB Output is correct
53 Correct 63 ms 8532 KB Output is correct
54 Correct 59 ms 19292 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 7772 KB Output is correct
2 Correct 1 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 2 ms 7772 KB Output is correct
5 Correct 6 ms 7772 KB Output is correct
6 Correct 2 ms 7772 KB Output is correct
7 Correct 2 ms 7772 KB Output is correct
8 Correct 2 ms 7768 KB Output is correct
9 Correct 2 ms 7772 KB Output is correct
10 Correct 2 ms 7772 KB Output is correct
11 Correct 2 ms 7944 KB Output is correct
12 Correct 5 ms 8024 KB Output is correct
13 Correct 45 ms 8284 KB Output is correct
14 Correct 43 ms 8788 KB Output is correct
15 Correct 35 ms 8536 KB Output is correct
16 Correct 2253 ms 19732 KB Output is correct
17 Execution timed out 5027 ms 20172 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 14 ms 7772 KB Output is correct
5 Correct 18 ms 7988 KB Output is correct
6 Correct 2 ms 7772 KB Output is correct
7 Correct 2 ms 7772 KB Output is correct
8 Correct 4 ms 7772 KB Output is correct
9 Correct 47 ms 8540 KB Output is correct
10 Correct 40 ms 25684 KB Output is correct
11 Correct 6 ms 7768 KB Output is correct
12 Correct 37 ms 7772 KB Output is correct
13 Execution timed out 5087 ms 25480 KB Time limit exceeded
14 Halted 0 ms 0 KB -