oj.uz

답안 #555893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555893 2022-05-01T18:41:19 Z Koosha_mv Jail (JOI22_jail) C++14
100 / 100
 456 ms 59156 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=5e5+99;

int n,m,ans,Time,a[N],b[N],t[N],h[N],st[N],ft[N],sz[N],up[N],vis[N],par[N],seg0[N];
vector<int> topo,g[N],seg1[N];

void Dfs(int );

void dfs1(int u,int p){
	f(i,0,g[u].size()) if(g[u][i]==p) g[u].erase(g[u].begin()+i);
	sz[u]=1;
	par[u]=p;
	for(auto v : g[u]){
		h[v]=h[u]+1;
		dfs1(v,u);
		sz[u]+=sz[v];
	}
	sort(all(g[u]),[&](int u,int v){ return sz[u]>sz[v]; });
	
}
void dfs2(int u){
	st[u]=Time++;
	for(auto v : g[u]) up[v]=(v==g[u][0] ? up[u] : v),dfs2(v);
	ft[u]=Time;
}
int pet(int l,int r){
	int ans=0;
	for(l+=n,r+=n;l<r;l>>=1,r>>=1){
		if(l&1) ans+=seg0[l++];
		if(r&1) ans+=seg0[--r];
	}
	return ans;
}
int Get(int u,int v){
	int ans=0;
	while(up[u]!=up[v]){
		if(h[up[u]]<h[up[v]]) swap(u,v);
		ans+=pet(st[up[u]],st[u]+1);
		u=par[up[u]];
	}
	if(h[u]>h[v]) swap(u,v);
	ans+=pet(st[u],st[v]+1);
	return ans;
}
void add(int l,int r,int id){
	for(l+=n,r+=n;l<r;l>>=1,r>>=1){
		if(l&1){
			seg1[l++].pb(id);
		}
		if(r&1){
			seg1[--r].pb(id);
		}
	}
}
void add0(int x,int val){
	for(x+=n;x>0;x>>=1) seg0[x]+=val;
}
void add1(int u,int v,int id){
	while(up[u]!=up[v]){
		if(h[up[u]]<h[up[v]]) swap(u,v);
		add(st[up[u]],st[u]+1,id);
		u=par[up[u]];
	}
	if(h[u]>h[v]) swap(u,v);
	add(st[u],st[v]+1,id);
}
void pert(int id){
	if(seg0[id]==0) return ;
	if(n<=id){
		Dfs(t[id-n]);
		return ;
	}
	pert(id<<1);
	pert(id<<1|1);
}
void get2(int l,int r){
	for(l+=n,r+=n;l<r;l>>=1,r>>=1){
		if(l&1) pert(l++);
		if(r&1) pert(--r);
	}
}
void get1(int u,int v){
	while(up[u]!=up[v]){
		if(h[up[u]]<h[up[v]]) swap(u,v);
		get2(st[up[u]],st[u]+1);
		u=par[up[u]];
	}
	if(h[u]>h[v]) swap(u,v);
	get2(st[u],st[v]+1);
}
void Dfs(int u){
	if(vis[u]) return ;
	add0(st[b[u]],-1);
	vis[u]=1;
	for(int x=st[a[u]]+n;x>0;x>>=1){
		while(seg1[x].size()){
			int v=seg1[x].back();
			seg1[x].pop_back();
			Dfs(v);
		}
	}
	get1(a[u],b[u]);
	topo.pb(u);
}
void Main(){
	cin>>n;
	f(i,1,n){
		int u,v;
		cin>>u>>v;
		g[u].pb(v);
		g[v].pb(u);
	}
	up[1]=1;
	dfs1(1,1);
	dfs2(1);	
	cin>>m;
	f(i,1,m+1){
		cin>>a[i]>>b[i];
		t[st[b[i]]]=i;
		add0(st[b[i]],1);
		add1(a[i],b[i],i);
	}
	f(i,1,m+1){
		Dfs(i);
	}
	reverse(all(topo));
	fill(seg0,seg0+(n<<1),0);
	f(i,1,m+1) add0(st[a[i]],1);
	for(auto x : topo){
		add0(st[a[x]],-1);
		if(Get(a[x],b[x])){
			cout<<"No"<<'\n';
			return ;
		}
		add0(st[b[x]],1);
	}
	cout<<"Yes"<<'\n';
}

int32_t main(){
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int tc;
	cin>>tc;
	while(tc--){
		Main();
		Time=0;
		int mx=2*max(n,m)+10;
		topo.clear();
		f(i,0,mx) g[i].clear(),seg1[i].clear(),t[i]=vis[i]=seg0[i]=0;
	}
}

Compilation message

jail.cpp: In function 'void dfs1(int, int)':
jail.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   31 |  f(i,0,g[u].size()) if(g[u][i]==p) g[u].erase(g[u].begin()+i);
      |    ~~~~~~~~~~~~~~~             
jail.cpp:31:2: note: in expansion of macro 'f'
   31 |  f(i,0,g[u].size()) if(g[u][i]==p) g[u].erase(g[u].begin()+i);
      |  ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 11 ms 23848 KB Output is correct
4 Correct 20 ms 23960 KB Output is correct
5 Correct 31 ms 23940 KB Output is correct
6 Correct 15 ms 23892 KB Output is correct
7 Correct 15 ms 23936 KB Output is correct
8 Correct 17 ms 23892 KB Output is correct
9 Correct 40 ms 25160 KB Output is correct
10 Correct 55 ms 42768 KB Output is correct
11 Correct 17 ms 23892 KB Output is correct
12 Correct 40 ms 23980 KB Output is correct
13 Correct 99 ms 47636 KB Output is correct
14 Correct 103 ms 50124 KB Output is correct
15 Correct 185 ms 50112 KB Output is correct
16 Correct 378 ms 56900 KB Output is correct
17 Correct 109 ms 50188 KB Output is correct
18 Correct 125 ms 50064 KB Output is correct
19 Correct 107 ms 49864 KB Output is correct
20 Correct 97 ms 49884 KB Output is correct
21 Correct 109 ms 50016 KB Output is correct
22 Correct 84 ms 47428 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23952 KB Output is correct
2 Correct 15 ms 23872 KB Output is correct
3 Correct 18 ms 23948 KB Output is correct
4 Correct 15 ms 23892 KB Output is correct
5 Correct 14 ms 23832 KB Output is correct
6 Correct 14 ms 23844 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 16 ms 23828 KB Output is correct
9 Correct 14 ms 23936 KB Output is correct
10 Correct 14 ms 23892 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 15 ms 23828 KB Output is correct
13 Correct 14 ms 23828 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23952 KB Output is correct
2 Correct 15 ms 23872 KB Output is correct
3 Correct 18 ms 23948 KB Output is correct
4 Correct 15 ms 23892 KB Output is correct
5 Correct 14 ms 23832 KB Output is correct
6 Correct 14 ms 23844 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 16 ms 23828 KB Output is correct
9 Correct 14 ms 23936 KB Output is correct
10 Correct 14 ms 23892 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 15 ms 23828 KB Output is correct
13 Correct 14 ms 23828 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 15 ms 23888 KB Output is correct
16 Correct 14 ms 23892 KB Output is correct
17 Correct 15 ms 23928 KB Output is correct
18 Correct 14 ms 23840 KB Output is correct
19 Correct 13 ms 23892 KB Output is correct
20 Correct 16 ms 23824 KB Output is correct
21 Correct 14 ms 23892 KB Output is correct
22 Correct 14 ms 23956 KB Output is correct
23 Correct 13 ms 23772 KB Output is correct
24 Correct 15 ms 23880 KB Output is correct
25 Correct 16 ms 23900 KB Output is correct
26 Correct 13 ms 23828 KB Output is correct
27 Correct 15 ms 23892 KB Output is correct
28 Correct 13 ms 23896 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23952 KB Output is correct
2 Correct 15 ms 23872 KB Output is correct
3 Correct 18 ms 23948 KB Output is correct
4 Correct 15 ms 23892 KB Output is correct
5 Correct 14 ms 23832 KB Output is correct
6 Correct 14 ms 23844 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 16 ms 23828 KB Output is correct
9 Correct 14 ms 23936 KB Output is correct
10 Correct 14 ms 23892 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 15 ms 23828 KB Output is correct
13 Correct 14 ms 23828 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 15 ms 23888 KB Output is correct
16 Correct 14 ms 23892 KB Output is correct
17 Correct 15 ms 23928 KB Output is correct
18 Correct 14 ms 23840 KB Output is correct
19 Correct 13 ms 23892 KB Output is correct
20 Correct 16 ms 23824 KB Output is correct
21 Correct 14 ms 23892 KB Output is correct
22 Correct 14 ms 23956 KB Output is correct
23 Correct 13 ms 23772 KB Output is correct
24 Correct 15 ms 23880 KB Output is correct
25 Correct 16 ms 23900 KB Output is correct
26 Correct 13 ms 23828 KB Output is correct
27 Correct 15 ms 23892 KB Output is correct
28 Correct 13 ms 23896 KB Output is correct
29 Correct 16 ms 23892 KB Output is correct
30 Correct 17 ms 23892 KB Output is correct
31 Correct 16 ms 23940 KB Output is correct
32 Correct 16 ms 23916 KB Output is correct
33 Correct 13 ms 23932 KB Output is correct
34 Correct 15 ms 23892 KB Output is correct
35 Correct 15 ms 23892 KB Output is correct
36 Correct 14 ms 23892 KB Output is correct
37 Correct 15 ms 23892 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23952 KB Output is correct
2 Correct 15 ms 23872 KB Output is correct
3 Correct 18 ms 23948 KB Output is correct
4 Correct 15 ms 23892 KB Output is correct
5 Correct 14 ms 23832 KB Output is correct
6 Correct 14 ms 23844 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 16 ms 23828 KB Output is correct
9 Correct 14 ms 23936 KB Output is correct
10 Correct 14 ms 23892 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 15 ms 23828 KB Output is correct
13 Correct 14 ms 23828 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 15 ms 23888 KB Output is correct
16 Correct 14 ms 23892 KB Output is correct
17 Correct 15 ms 23928 KB Output is correct
18 Correct 14 ms 23840 KB Output is correct
19 Correct 13 ms 23892 KB Output is correct
20 Correct 16 ms 23824 KB Output is correct
21 Correct 14 ms 23892 KB Output is correct
22 Correct 14 ms 23956 KB Output is correct
23 Correct 13 ms 23772 KB Output is correct
24 Correct 15 ms 23880 KB Output is correct
25 Correct 16 ms 23900 KB Output is correct
26 Correct 13 ms 23828 KB Output is correct
27 Correct 15 ms 23892 KB Output is correct
28 Correct 13 ms 23896 KB Output is correct
29 Correct 16 ms 23892 KB Output is correct
30 Correct 17 ms 23892 KB Output is correct
31 Correct 16 ms 23940 KB Output is correct
32 Correct 16 ms 23916 KB Output is correct
33 Correct 13 ms 23932 KB Output is correct
34 Correct 15 ms 23892 KB Output is correct
35 Correct 15 ms 23892 KB Output is correct
36 Correct 14 ms 23892 KB Output is correct
37 Correct 15 ms 23892 KB Output is correct
38 Correct 45 ms 25132 KB Output is correct
39 Correct 57 ms 42708 KB Output is correct
40 Correct 57 ms 25012 KB Output is correct
41 Correct 58 ms 24976 KB Output is correct
42 Correct 46 ms 25136 KB Output is correct
43 Correct 36 ms 24652 KB Output is correct
44 Correct 24 ms 24176 KB Output is correct
45 Correct 87 ms 33440 KB Output is correct
46 Correct 81 ms 33580 KB Output is correct
47 Correct 57 ms 38140 KB Output is correct
48 Correct 72 ms 38128 KB Output is correct
49 Correct 68 ms 33768 KB Output is correct
50 Correct 68 ms 33776 KB Output is correct
51 Correct 60 ms 34936 KB Output is correct
52 Correct 56 ms 34892 KB Output is correct
53 Correct 27 ms 24708 KB Output is correct
54 Correct 86 ms 33508 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23788 KB Output is correct
3 Correct 12 ms 23776 KB Output is correct
4 Correct 14 ms 23844 KB Output is correct
5 Correct 22 ms 23968 KB Output is correct
6 Correct 13 ms 23936 KB Output is correct
7 Correct 15 ms 23892 KB Output is correct
8 Correct 13 ms 23896 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 12 ms 23820 KB Output is correct
11 Correct 14 ms 23804 KB Output is correct
12 Correct 14 ms 23888 KB Output is correct
13 Correct 38 ms 24020 KB Output is correct
14 Correct 53 ms 23892 KB Output is correct
15 Correct 41 ms 23892 KB Output is correct
16 Correct 105 ms 35164 KB Output is correct
17 Correct 244 ms 43016 KB Output is correct
18 Correct 428 ms 54680 KB Output is correct
19 Correct 143 ms 36744 KB Output is correct
20 Correct 125 ms 36688 KB Output is correct
21 Correct 151 ms 36692 KB Output is correct
22 Correct 197 ms 41908 KB Output is correct
23 Correct 153 ms 41060 KB Output is correct
24 Correct 180 ms 41188 KB Output is correct
25 Correct 149 ms 41252 KB Output is correct
26 Correct 180 ms 41092 KB Output is correct
27 Correct 254 ms 41900 KB Output is correct
28 Correct 239 ms 48928 KB Output is correct
29 Correct 210 ms 43924 KB Output is correct
30 Correct 144 ms 47624 KB Output is correct
31 Correct 150 ms 49736 KB Output is correct
32 Correct 170 ms 40852 KB Output is correct
33 Correct 164 ms 43176 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 11 ms 23848 KB Output is correct
4 Correct 20 ms 23960 KB Output is correct
5 Correct 31 ms 23940 KB Output is correct
6 Correct 15 ms 23892 KB Output is correct
7 Correct 15 ms 23936 KB Output is correct
8 Correct 17 ms 23892 KB Output is correct
9 Correct 40 ms 25160 KB Output is correct
10 Correct 55 ms 42768 KB Output is correct
11 Correct 17 ms 23892 KB Output is correct
12 Correct 40 ms 23980 KB Output is correct
13 Correct 99 ms 47636 KB Output is correct
14 Correct 103 ms 50124 KB Output is correct
15 Correct 185 ms 50112 KB Output is correct
16 Correct 378 ms 56900 KB Output is correct
17 Correct 109 ms 50188 KB Output is correct
18 Correct 125 ms 50064 KB Output is correct
19 Correct 107 ms 49864 KB Output is correct
20 Correct 97 ms 49884 KB Output is correct
21 Correct 109 ms 50016 KB Output is correct
22 Correct 84 ms 47428 KB Output is correct
23 Correct 23 ms 23952 KB Output is correct
24 Correct 15 ms 23872 KB Output is correct
25 Correct 18 ms 23948 KB Output is correct
26 Correct 15 ms 23892 KB Output is correct
27 Correct 14 ms 23832 KB Output is correct
28 Correct 14 ms 23844 KB Output is correct
29 Correct 14 ms 23892 KB Output is correct
30 Correct 16 ms 23828 KB Output is correct
31 Correct 14 ms 23936 KB Output is correct
32 Correct 14 ms 23892 KB Output is correct
33 Correct 13 ms 23892 KB Output is correct
34 Correct 15 ms 23828 KB Output is correct
35 Correct 14 ms 23828 KB Output is correct
36 Correct 13 ms 23764 KB Output is correct
37 Correct 15 ms 23888 KB Output is correct
38 Correct 14 ms 23892 KB Output is correct
39 Correct 15 ms 23928 KB Output is correct
40 Correct 14 ms 23840 KB Output is correct
41 Correct 13 ms 23892 KB Output is correct
42 Correct 16 ms 23824 KB Output is correct
43 Correct 14 ms 23892 KB Output is correct
44 Correct 14 ms 23956 KB Output is correct
45 Correct 13 ms 23772 KB Output is correct
46 Correct 15 ms 23880 KB Output is correct
47 Correct 16 ms 23900 KB Output is correct
48 Correct 13 ms 23828 KB Output is correct
49 Correct 15 ms 23892 KB Output is correct
50 Correct 13 ms 23896 KB Output is correct
51 Correct 16 ms 23892 KB Output is correct
52 Correct 17 ms 23892 KB Output is correct
53 Correct 16 ms 23940 KB Output is correct
54 Correct 16 ms 23916 KB Output is correct
55 Correct 13 ms 23932 KB Output is correct
56 Correct 15 ms 23892 KB Output is correct
57 Correct 15 ms 23892 KB Output is correct
58 Correct 14 ms 23892 KB Output is correct
59 Correct 15 ms 23892 KB Output is correct
60 Correct 45 ms 25132 KB Output is correct
61 Correct 57 ms 42708 KB Output is correct
62 Correct 57 ms 25012 KB Output is correct
63 Correct 58 ms 24976 KB Output is correct
64 Correct 46 ms 25136 KB Output is correct
65 Correct 36 ms 24652 KB Output is correct
66 Correct 24 ms 24176 KB Output is correct
67 Correct 87 ms 33440 KB Output is correct
68 Correct 81 ms 33580 KB Output is correct
69 Correct 57 ms 38140 KB Output is correct
70 Correct 72 ms 38128 KB Output is correct
71 Correct 68 ms 33768 KB Output is correct
72 Correct 68 ms 33776 KB Output is correct
73 Correct 60 ms 34936 KB Output is correct
74 Correct 56 ms 34892 KB Output is correct
75 Correct 27 ms 24708 KB Output is correct
76 Correct 86 ms 33508 KB Output is correct
77 Correct 13 ms 23764 KB Output is correct
78 Correct 13 ms 23788 KB Output is correct
79 Correct 12 ms 23776 KB Output is correct
80 Correct 14 ms 23844 KB Output is correct
81 Correct 22 ms 23968 KB Output is correct
82 Correct 13 ms 23936 KB Output is correct
83 Correct 15 ms 23892 KB Output is correct
84 Correct 13 ms 23896 KB Output is correct
85 Correct 13 ms 23764 KB Output is correct
86 Correct 12 ms 23820 KB Output is correct
87 Correct 14 ms 23804 KB Output is correct
88 Correct 14 ms 23888 KB Output is correct
89 Correct 38 ms 24020 KB Output is correct
90 Correct 53 ms 23892 KB Output is correct
91 Correct 41 ms 23892 KB Output is correct
92 Correct 105 ms 35164 KB Output is correct
93 Correct 244 ms 43016 KB Output is correct
94 Correct 428 ms 54680 KB Output is correct
95 Correct 143 ms 36744 KB Output is correct
96 Correct 125 ms 36688 KB Output is correct
97 Correct 151 ms 36692 KB Output is correct
98 Correct 197 ms 41908 KB Output is correct
99 Correct 153 ms 41060 KB Output is correct
100 Correct 180 ms 41188 KB Output is correct
101 Correct 149 ms 41252 KB Output is correct
102 Correct 180 ms 41092 KB Output is correct
103 Correct 254 ms 41900 KB Output is correct
104 Correct 239 ms 48928 KB Output is correct
105 Correct 210 ms 43924 KB Output is correct
106 Correct 144 ms 47624 KB Output is correct
107 Correct 150 ms 49736 KB Output is correct
108 Correct 170 ms 40852 KB Output is correct
109 Correct 164 ms 43176 KB Output is correct
110 Correct 48 ms 24268 KB Output is correct
111 Correct 33 ms 24128 KB Output is correct
112 Correct 184 ms 47680 KB Output is correct
113 Correct 105 ms 42252 KB Output is correct
114 Correct 140 ms 44972 KB Output is correct
115 Correct 46 ms 34248 KB Output is correct
116 Correct 155 ms 38700 KB Output is correct
117 Correct 456 ms 59156 KB Output is correct
118 Correct 81 ms 33796 KB Output is correct
119 Correct 107 ms 33708 KB Output is correct
120 Correct 21 ms 25244 KB Output is correct
121 Correct 181 ms 39324 KB Output is correct
122 Correct 166 ms 39236 KB Output is correct
123 Correct 120 ms 44300 KB Output is correct
124 Correct 140 ms 44108 KB Output is correct
125 Correct 123 ms 44512 KB Output is correct
126 Correct 351 ms 57668 KB Output is correct
127 Correct 172 ms 50540 KB Output is correct
128 Correct 124 ms 51300 KB Output is correct
129 Correct 121 ms 47212 KB Output is correct
130 Correct 124 ms 47404 KB Output is correct