oj.uz

Submission #1017632

# Submission time Handle Problem Language Result Execution time Memory
1017632 2024-07-09T09:15:16 Z Unforgettablepl Jail (JOI22_jail) C++17
61 / 100
 5000 ms 44856 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int modulo = 1e9+7;

void solve(){
	int n;
	cin >> n;
	vector<vector<int>> adj(n+1);
	for(int i=1;i<n;i++){
		int a,b;cin>>a>>b;
		adj[a].emplace_back(b);
		adj[b].emplace_back(a);
	}
	vector<int> depth(n+1);
	vector<vector<int>> p(n+1,vector<int>(17));
	function<void(int,int,int)> dfs = [&](int x,int par,int dep){
		depth[x]=dep;
		p[x][0]=par;
		for(int&i:adj[x])if(i!=par)dfs(i,x,dep+1);
	};
	dfs(1,0,1);
	for(int bit=1;bit<17;bit++){
		for(int i=1;i<=n;i++){
			p[i][bit] = p[p[i][bit-1]][bit-1];
		}
	}
	auto lift = [&](int x,int tar){
		for(int bit=0;bit<17;bit++)if(tar&(1<<bit))x=p[x][bit];
		return x;
	};
	int m;
	cin >> m;
	vector<vector<int>> secadj(m+1);
	vector<int> s(m+1);
	vector<int> t(m+1);
	auto collides = [&](int curr,int v){
		int a = s[curr];
		int b = t[curr];
		if(a==v or b==v)return true;
		bool worksa = false;
		if(depth[a]>=depth[v] and lift(a,depth[a]-depth[v])==v)worksa=true;
		bool worksb = false;
		if(depth[b]>=depth[v] and lift(b,depth[b]-depth[v])==v)worksb=true;
		if(worksa and worksb){
			return lift(a,depth[a]-depth[v]-1)!=lift(b,depth[b]-depth[v]-1);
		} else return worksa or worksb;
	};
	for(int i=1;i<=m;i++)cin>>s[i]>>t[i];
	for(int i=1;i<=m;i++){
		for(int j=1;j<=m;j++){
			if(i==j)continue;
			if(collides(i,t[j]))secadj[j].emplace_back(i);
			if(collides(i,s[j]))secadj[i].emplace_back(j);
		}
	}
	vector<int> visited(m+1);
	bool works = true;
	function<void(int)> secdfs = [&](int x){
		if(visited[x]==2)return;
		if(visited[x]==1){
			works = false;
			return;
		}
		visited[x]=1;
		for(int&i:secadj[x])secdfs(i);
		visited[x]=2;
	};
	for(int i=1;i<=m;i++)secdfs(i);
	if(works){
		cout << "Yes\n";
	} else cout << "No\n";
}

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int t;
	cin >> t;
	while(t--)solve();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 14 ms 492 KB Output is correct
5 Correct 24 ms 1220 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 27 ms 596 KB Output is correct
9 Correct 1018 ms 6224 KB Output is correct
10 Correct 80 ms 42832 KB Output is correct
11 Correct 11 ms 600 KB Output is correct
12 Correct 337 ms 1660 KB Output is correct
13 Execution timed out 5068 ms 44856 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 880 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 2 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 880 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 564 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 2 ms 388 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 880 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 564 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 2 ms 388 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 27 ms 596 KB Output is correct
30 Correct 11 ms 348 KB Output is correct
31 Correct 10 ms 604 KB Output is correct
32 Correct 5 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 18 ms 348 KB Output is correct
35 Correct 15 ms 604 KB Output is correct
36 Correct 19 ms 348 KB Output is correct
37 Correct 9 ms 348 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 880 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 564 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 2 ms 388 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 27 ms 596 KB Output is correct
30 Correct 11 ms 348 KB Output is correct
31 Correct 10 ms 604 KB Output is correct
32 Correct 5 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 18 ms 348 KB Output is correct
35 Correct 15 ms 604 KB Output is correct
36 Correct 19 ms 348 KB Output is correct
37 Correct 9 ms 348 KB Output is correct
38 Correct 1038 ms 6040 KB Output is correct
39 Correct 76 ms 42832 KB Output is correct
40 Correct 635 ms 4164 KB Output is correct
41 Correct 334 ms 3008 KB Output is correct
42 Correct 389 ms 3676 KB Output is correct
43 Correct 38 ms 3124 KB Output is correct
44 Correct 219 ms 876 KB Output is correct
45 Correct 71 ms 29500 KB Output is correct
46 Correct 73 ms 29520 KB Output is correct
47 Correct 95 ms 35156 KB Output is correct
48 Correct 93 ms 35156 KB Output is correct
49 Correct 80 ms 29788 KB Output is correct
50 Correct 88 ms 29776 KB Output is correct
51 Correct 49 ms 31316 KB Output is correct
52 Correct 50 ms 31568 KB Output is correct
53 Correct 257 ms 2908 KB Output is correct
54 Correct 76 ms 30364 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 11 ms 476 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 11 ms 348 KB Output is correct
13 Correct 145 ms 1020 KB Output is correct
14 Correct 84 ms 1104 KB Output is correct
15 Correct 143 ms 1108 KB Output is correct
16 Execution timed out 5060 ms 30468 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 14 ms 492 KB Output is correct
5 Correct 24 ms 1220 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 27 ms 596 KB Output is correct
9 Correct 1018 ms 6224 KB Output is correct
10 Correct 80 ms 42832 KB Output is correct
11 Correct 11 ms 600 KB Output is correct
12 Correct 337 ms 1660 KB Output is correct
13 Execution timed out 5068 ms 44856 KB Time limit exceeded
14 Halted 0 ms 0 KB -