oj.uz

Submission #1114559

# Submission time Handle Problem Language Result Execution time Memory
1114559 2024-11-19T07:48:37 Z thelegendary08 Jail (JOI22_jail) C++17
66 / 100
 233 ms 43136 KB 
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) cout<<#v<<' '; for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 120005;
int start[mxn];
int finish[mxn];
int timer = -1;
vvi adj(mxn);
vi dfs_order;
vi depth(mxn);
vi par(mxn);
vb vis(mxn);
vb inpath(mxn);
bool cycle;
vector<set<int>> diradj(mxn);
int timer2 = -1;
int s2[mxn];
int e2[mxn];
void euler_tour(int x, int from){
	dfs_order.pb(x);
	par[x] = from;
	if(x != 1)depth[x] = depth[from] + 1;
	timer++;
	timer2++;
	start[x] = timer;
	s2[x] = timer2;
	for(auto u : adj[x]){
		if(u != from){
			euler_tour(u, x);
			dfs_order.pb(x);
			timer++;
		}
	}
	finish[x] = timer;
	e2[x] = timer2;
}

bool dfs(int node){
	//dout(node);
	if(!vis[node]){
		vis[node] = 1;
		inpath[node] = 1;
		for(auto u : diradj[node]){
			if(!vis[u] && dfs(u))return 1;
			else if(inpath[u]){
				return 1;
			}
		}
		inpath[node] = 0;
	}
	return 0;
}

pii tree[mxn * 4];
int trs;
void update(int k, int x){
	k += trs;
	tree[k] = {x,k-trs};
	for(k/=2; k>=1; k/=2){
		if(tree[k*2].first < tree[k*2 + 1].first){
			tree[k] = tree[k*2];
		}
		else tree[k] = tree[k*2 + 1];
	}
	
}
int query(int l, int r){
	//out2(l,r);
	l += trs;
	r += trs;
	pii ret = {4e18, -1};
	while(l <= r){
		if(l % 2 == 1){
			if(tree[l].first < ret.first){
				ret = tree[l];
			}
			l++;
		}
		if(r % 2 == 0){
			if(tree[r].first < ret.first){
				ret = tree[r];
			}
			r--;
		}
		l/=2;
		r/=2;
	}
	return ret.second;
}

bool is_parent(int a, int b){
	//is a a parent of b?
	return s2[b] >= s2[a] && s2[b] <= e2[a];
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	int tt;
	cin>>tt;
	f0r(ttt, tt){
		in(n);
		trs = 2 * n - 1;
		timer = -1;
		timer2 = -1;
		FOR(i, 1, n+1){
			adj[i].clear();
			start[i] = 0;
			finish[i] = 0;
			s2[i] = 0;
			e2[i] = 0;
		}
		f0r(i,n-1){
			in2(a,b);
			adj[a].pb(b);
			adj[b].pb(a);
		}
		in(m);
		if(tt <= 20 && m<=500){
			FOR(i, 1, n+1)depth[i] = 0;
			FOR(i, 1, n+1)par[i] = -1;
			dfs_order.clear();
			
			vpii paths;
			vi starts(n+1, -1);
			vi ends(n+1, -1);
			
			f0r(i, m){
				in2(a,b);
				paths.pb({a,b});
				starts[a] = i;
				ends[b] = i;
			}
			euler_tour(1, -1);
			f0r(i, 2*n-1){
				update(i, depth[dfs_order[i]]);
			}
			
			f0r(i,m)diradj[i].clear();
			vi lca(m);
			f0r(i,m){
				//out2(finish[paths[i].first], start[paths[i].second]);
				if(start[paths[i].first] <= start[paths[i].second]){
					lca[i] = dfs_order[query(start[paths[i].first], start[paths[i].second])];
				}
				else{
					lca[i] = dfs_order[query(start[paths[i].second],start[paths[i].first])];
				}
			}
			//vout(lca);
			//vout(dfs_order);
			//FOR(i, 1, n+1)cout<<s2[i]<<' ';
			//cout<<'\n';
			//FOR(i, 1, n+1)cout<<e2[i]<<' ';
			//cout<<'\n';
			f0r(i,m){
				int st1 = paths[i].first;
				int en1 = paths[i].second;
				f0r(j,m){
					if(i != j){
						//check if start of j is on path, if end of j is on path
						//either par(j, start) and par(lca, j) or par(j, end) and par(lca, j)
						
						int st = paths[j].first;
						int en = paths[j].second;
						if(is_parent(lca[i], st) && (is_parent(st, st1) || is_parent(st, en1))){
							//j comes before i
							diradj[j].insert(i);
						}
						if(is_parent(lca[i], en) && (is_parent(en, st1) || is_parent(en, en1))){
							diradj[i].insert(j);
						}
						
					}
				}
			}
			/*
			f0r(i,m){
				vi path;
				int a = paths[i].first;
				int b = paths[i].second;
				vi revpath;
				while(depth[a] != depth[b]){
					if(depth[a] > depth[b]){
						path.pb(a);
						a = par[a];
					}
					else{
						revpath.pb(b);
						b = par[b];
					}
				}
				while(a != b){
					path.pb(a);
					revpath.pb(b);
					a = par[a];
					b = par[b];
				}
				path.pb(a);
				reverse(all(revpath));
				
				f0r(j, revpath.size())path.pb(revpath[j]);
				
				f0r(j, path.size()){
					if(starts[path[j]] != -1 && starts[path[j]] != i){
						diradj[starts[path[j]]].insert(i);
					}
					if(ends[path[j]] != -1 && ends[path[j]] != i){
						diradj[i].insert(ends[path[j]]);
					}
				}
				
			}
			*/
			f0r(i,m){
				//vout(diradj[i]);
			}
			
			f0r(i,m){
				vis[i] = 0;
				inpath[i] = 0;
			}
			cycle = 0;
			f0r(i,m){
				if(!vis[i]){
					bool ret = dfs(i);
					if(ret)cycle = 1;
					//out("NEXT");
				}
			}
			yn(!cycle);
			
			//vout(depth);
			//vout(par);
			//vout(dfs_order);
			/*
			vi loc(n+1);
			f0r(i, n){
				loc[dfs_order[i]] = i;
			}
			
			int spt[n][10];
			f0r(i,n)spt[i][0] = depth[dfs_order[i]];
			
			FOR(j, 1, 10){
				f0r(i, n - (1 << j) + 1){
					spt[i][j] = min(spt[i][j-1], spt[i + (1 << (j-1))][j-1]);
				}
			}
			*/
			
			
			
		}
		else{
			vpii v;
			vector<pair<pii,int>>w;
			f0r(i,m){
				in2(a,b);
				v.pb({min(a,b),max(a,b)});
				w.pb({{min(a,b),max(a,b)}, (a > b)});
			}
			sort(all(v));
			sort(all(w));
			int mx = -1;
			bool ok = 1;
			f0r(i,m){
				//out3(w[i].first.first, w[i].first.second, w[i].second);
			}
			f0r(i,m){
				if(v[i].second <= mx){
					ok = 0;
					break;
				}
				else{
					mx = v[i].second;
				}
			}
			mx = -1;
			int mx2 = -1;
			f0r(i, m){
				if(w[i].second){
					if(w[i].first.first < mx)ok = 0;
					else mx2 = w[i].first.second;
				}
				else{
					if(w[i].first.first < mx2)ok = 0;
					else mx = w[i].first.second;
				}
			}
			yn(ok);
		}
		
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14928 KB Output is correct
2 Correct 5 ms 14928 KB Output is correct
3 Correct 7 ms 14940 KB Output is correct
4 Correct 10 ms 15096 KB Output is correct
5 Correct 16 ms 14928 KB Output is correct
6 Correct 6 ms 14928 KB Output is correct
7 Correct 7 ms 14928 KB Output is correct
8 Correct 11 ms 15184 KB Output is correct
9 Correct 219 ms 25596 KB Output is correct
10 Correct 70 ms 43020 KB Output is correct
11 Correct 7 ms 14928 KB Output is correct
12 Correct 21 ms 15728 KB Output is correct
13 Correct 34 ms 21588 KB Output is correct
14 Correct 36 ms 22908 KB Output is correct
15 Correct 38 ms 21588 KB Output is correct
16 Correct 61 ms 27460 KB Output is correct
17 Correct 37 ms 23112 KB Output is correct
18 Correct 48 ms 25260 KB Output is correct
19 Correct 37 ms 24032 KB Output is correct
20 Correct 38 ms 23880 KB Output is correct
21 Correct 37 ms 23112 KB Output is correct
22 Correct 36 ms 23864 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14928 KB Output is correct
2 Correct 5 ms 14928 KB Output is correct
3 Correct 6 ms 14928 KB Output is correct
4 Correct 5 ms 14928 KB Output is correct
5 Correct 5 ms 14928 KB Output is correct
6 Correct 6 ms 14944 KB Output is correct
7 Correct 5 ms 14928 KB Output is correct
8 Correct 6 ms 14928 KB Output is correct
9 Correct 5 ms 14928 KB Output is correct
10 Correct 6 ms 14928 KB Output is correct
11 Correct 5 ms 14928 KB Output is correct
12 Correct 5 ms 15096 KB Output is correct
13 Correct 5 ms 14928 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14928 KB Output is correct
2 Correct 5 ms 14928 KB Output is correct
3 Correct 6 ms 14928 KB Output is correct
4 Correct 5 ms 14928 KB Output is correct
5 Correct 5 ms 14928 KB Output is correct
6 Correct 6 ms 14944 KB Output is correct
7 Correct 5 ms 14928 KB Output is correct
8 Correct 6 ms 14928 KB Output is correct
9 Correct 5 ms 14928 KB Output is correct
10 Correct 6 ms 14928 KB Output is correct
11 Correct 5 ms 14928 KB Output is correct
12 Correct 5 ms 15096 KB Output is correct
13 Correct 5 ms 14928 KB Output is correct
14 Correct 5 ms 14928 KB Output is correct
15 Correct 5 ms 14928 KB Output is correct
16 Correct 5 ms 14928 KB Output is correct
17 Correct 5 ms 14928 KB Output is correct
18 Correct 6 ms 14928 KB Output is correct
19 Correct 5 ms 14928 KB Output is correct
20 Correct 5 ms 14928 KB Output is correct
21 Correct 5 ms 14928 KB Output is correct
22 Correct 6 ms 14928 KB Output is correct
23 Correct 5 ms 14928 KB Output is correct
24 Correct 5 ms 14764 KB Output is correct
25 Correct 6 ms 14928 KB Output is correct
26 Correct 5 ms 14920 KB Output is correct
27 Correct 7 ms 14944 KB Output is correct
28 Correct 6 ms 14928 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14928 KB Output is correct
2 Correct 5 ms 14928 KB Output is correct
3 Correct 6 ms 14928 KB Output is correct
4 Correct 5 ms 14928 KB Output is correct
5 Correct 5 ms 14928 KB Output is correct
6 Correct 6 ms 14944 KB Output is correct
7 Correct 5 ms 14928 KB Output is correct
8 Correct 6 ms 14928 KB Output is correct
9 Correct 5 ms 14928 KB Output is correct
10 Correct 6 ms 14928 KB Output is correct
11 Correct 5 ms 14928 KB Output is correct
12 Correct 5 ms 15096 KB Output is correct
13 Correct 5 ms 14928 KB Output is correct
14 Correct 5 ms 14928 KB Output is correct
15 Correct 5 ms 14928 KB Output is correct
16 Correct 5 ms 14928 KB Output is correct
17 Correct 5 ms 14928 KB Output is correct
18 Correct 6 ms 14928 KB Output is correct
19 Correct 5 ms 14928 KB Output is correct
20 Correct 5 ms 14928 KB Output is correct
21 Correct 5 ms 14928 KB Output is correct
22 Correct 6 ms 14928 KB Output is correct
23 Correct 5 ms 14928 KB Output is correct
24 Correct 5 ms 14764 KB Output is correct
25 Correct 6 ms 14928 KB Output is correct
26 Correct 5 ms 14920 KB Output is correct
27 Correct 7 ms 14944 KB Output is correct
28 Correct 6 ms 14928 KB Output is correct
29 Correct 12 ms 15184 KB Output is correct
30 Correct 9 ms 15096 KB Output is correct
31 Correct 10 ms 14928 KB Output is correct
32 Correct 6 ms 14928 KB Output is correct
33 Correct 6 ms 15072 KB Output is correct
34 Correct 9 ms 14928 KB Output is correct
35 Correct 14 ms 15184 KB Output is correct
36 Correct 10 ms 14928 KB Output is correct
37 Correct 7 ms 15096 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14928 KB Output is correct
2 Correct 5 ms 14928 KB Output is correct
3 Correct 6 ms 14928 KB Output is correct
4 Correct 5 ms 14928 KB Output is correct
5 Correct 5 ms 14928 KB Output is correct
6 Correct 6 ms 14944 KB Output is correct
7 Correct 5 ms 14928 KB Output is correct
8 Correct 6 ms 14928 KB Output is correct
9 Correct 5 ms 14928 KB Output is correct
10 Correct 6 ms 14928 KB Output is correct
11 Correct 5 ms 14928 KB Output is correct
12 Correct 5 ms 15096 KB Output is correct
13 Correct 5 ms 14928 KB Output is correct
14 Correct 5 ms 14928 KB Output is correct
15 Correct 5 ms 14928 KB Output is correct
16 Correct 5 ms 14928 KB Output is correct
17 Correct 5 ms 14928 KB Output is correct
18 Correct 6 ms 14928 KB Output is correct
19 Correct 5 ms 14928 KB Output is correct
20 Correct 5 ms 14928 KB Output is correct
21 Correct 5 ms 14928 KB Output is correct
22 Correct 6 ms 14928 KB Output is correct
23 Correct 5 ms 14928 KB Output is correct
24 Correct 5 ms 14764 KB Output is correct
25 Correct 6 ms 14928 KB Output is correct
26 Correct 5 ms 14920 KB Output is correct
27 Correct 7 ms 14944 KB Output is correct
28 Correct 6 ms 14928 KB Output is correct
29 Correct 12 ms 15184 KB Output is correct
30 Correct 9 ms 15096 KB Output is correct
31 Correct 10 ms 14928 KB Output is correct
32 Correct 6 ms 14928 KB Output is correct
33 Correct 6 ms 15072 KB Output is correct
34 Correct 9 ms 14928 KB Output is correct
35 Correct 14 ms 15184 KB Output is correct
36 Correct 10 ms 14928 KB Output is correct
37 Correct 7 ms 15096 KB Output is correct
38 Correct 233 ms 26056 KB Output is correct
39 Correct 78 ms 43136 KB Output is correct
40 Correct 205 ms 21832 KB Output is correct
41 Correct 97 ms 18492 KB Output is correct
42 Correct 173 ms 22236 KB Output is correct
43 Correct 29 ms 19036 KB Output is correct
44 Correct 43 ms 15688 KB Output is correct
45 Correct 64 ms 31928 KB Output is correct
46 Correct 60 ms 31712 KB Output is correct
47 Correct 47 ms 35512 KB Output is correct
48 Correct 50 ms 35520 KB Output is correct
49 Correct 56 ms 31936 KB Output is correct
50 Correct 56 ms 31936 KB Output is correct
51 Correct 44 ms 33088 KB Output is correct
52 Correct 46 ms 32968 KB Output is correct
53 Correct 53 ms 18248 KB Output is correct
54 Correct 71 ms 32440 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14928 KB Output is correct
2 Correct 6 ms 14928 KB Output is correct
3 Correct 6 ms 14928 KB Output is correct
4 Correct 5 ms 15100 KB Output is correct
5 Correct 8 ms 14928 KB Output is correct
6 Correct 6 ms 14928 KB Output is correct
7 Correct 5 ms 14928 KB Output is correct
8 Correct 5 ms 14928 KB Output is correct
9 Correct 5 ms 14928 KB Output is correct
10 Correct 6 ms 14928 KB Output is correct
11 Correct 5 ms 14952 KB Output is correct
12 Correct 8 ms 14928 KB Output is correct
13 Incorrect 14 ms 14928 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14928 KB Output is correct
2 Correct 5 ms 14928 KB Output is correct
3 Correct 7 ms 14940 KB Output is correct
4 Correct 10 ms 15096 KB Output is correct
5 Correct 16 ms 14928 KB Output is correct
6 Correct 6 ms 14928 KB Output is correct
7 Correct 7 ms 14928 KB Output is correct
8 Correct 11 ms 15184 KB Output is correct
9 Correct 219 ms 25596 KB Output is correct
10 Correct 70 ms 43020 KB Output is correct
11 Correct 7 ms 14928 KB Output is correct
12 Correct 21 ms 15728 KB Output is correct
13 Correct 34 ms 21588 KB Output is correct
14 Correct 36 ms 22908 KB Output is correct
15 Correct 38 ms 21588 KB Output is correct
16 Correct 61 ms 27460 KB Output is correct
17 Correct 37 ms 23112 KB Output is correct
18 Correct 48 ms 25260 KB Output is correct
19 Correct 37 ms 24032 KB Output is correct
20 Correct 38 ms 23880 KB Output is correct
21 Correct 37 ms 23112 KB Output is correct
22 Correct 36 ms 23864 KB Output is correct
23 Correct 4 ms 14928 KB Output is correct
24 Correct 5 ms 14928 KB Output is correct
25 Correct 6 ms 14928 KB Output is correct
26 Correct 5 ms 14928 KB Output is correct
27 Correct 5 ms 14928 KB Output is correct
28 Correct 6 ms 14944 KB Output is correct
29 Correct 5 ms 14928 KB Output is correct
30 Correct 6 ms 14928 KB Output is correct
31 Correct 5 ms 14928 KB Output is correct
32 Correct 6 ms 14928 KB Output is correct
33 Correct 5 ms 14928 KB Output is correct
34 Correct 5 ms 15096 KB Output is correct
35 Correct 5 ms 14928 KB Output is correct
36 Correct 5 ms 14928 KB Output is correct
37 Correct 5 ms 14928 KB Output is correct
38 Correct 5 ms 14928 KB Output is correct
39 Correct 5 ms 14928 KB Output is correct
40 Correct 6 ms 14928 KB Output is correct
41 Correct 5 ms 14928 KB Output is correct
42 Correct 5 ms 14928 KB Output is correct
43 Correct 5 ms 14928 KB Output is correct
44 Correct 6 ms 14928 KB Output is correct
45 Correct 5 ms 14928 KB Output is correct
46 Correct 5 ms 14764 KB Output is correct
47 Correct 6 ms 14928 KB Output is correct
48 Correct 5 ms 14920 KB Output is correct
49 Correct 7 ms 14944 KB Output is correct
50 Correct 6 ms 14928 KB Output is correct
51 Correct 12 ms 15184 KB Output is correct
52 Correct 9 ms 15096 KB Output is correct
53 Correct 10 ms 14928 KB Output is correct
54 Correct 6 ms 14928 KB Output is correct
55 Correct 6 ms 15072 KB Output is correct
56 Correct 9 ms 14928 KB Output is correct
57 Correct 14 ms 15184 KB Output is correct
58 Correct 10 ms 14928 KB Output is correct
59 Correct 7 ms 15096 KB Output is correct
60 Correct 233 ms 26056 KB Output is correct
61 Correct 78 ms 43136 KB Output is correct
62 Correct 205 ms 21832 KB Output is correct
63 Correct 97 ms 18492 KB Output is correct
64 Correct 173 ms 22236 KB Output is correct
65 Correct 29 ms 19036 KB Output is correct
66 Correct 43 ms 15688 KB Output is correct
67 Correct 64 ms 31928 KB Output is correct
68 Correct 60 ms 31712 KB Output is correct
69 Correct 47 ms 35512 KB Output is correct
70 Correct 50 ms 35520 KB Output is correct
71 Correct 56 ms 31936 KB Output is correct
72 Correct 56 ms 31936 KB Output is correct
73 Correct 44 ms 33088 KB Output is correct
74 Correct 46 ms 32968 KB Output is correct
75 Correct 53 ms 18248 KB Output is correct
76 Correct 71 ms 32440 KB Output is correct
77 Correct 5 ms 14928 KB Output is correct
78 Correct 6 ms 14928 KB Output is correct
79 Correct 6 ms 14928 KB Output is correct
80 Correct 5 ms 15100 KB Output is correct
81 Correct 8 ms 14928 KB Output is correct
82 Correct 6 ms 14928 KB Output is correct
83 Correct 5 ms 14928 KB Output is correct
84 Correct 5 ms 14928 KB Output is correct
85 Correct 5 ms 14928 KB Output is correct
86 Correct 6 ms 14928 KB Output is correct
87 Correct 5 ms 14952 KB Output is correct
88 Correct 8 ms 14928 KB Output is correct
89 Incorrect 14 ms 14928 KB Output isn't correct
90 Halted 0 ms 0 KB -