oj.uz

Submission #555881

# Submission time Handle Problem Language Result Execution time Memory
555881 2022-05-01T18:35:57 Z Koosha_mv Jail (JOI22_jail) C++14
72 / 100
 5000 ms 55572 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,lg=40;

int n,m,ans,Time,a[N],b[N],t[N],h[N],st[N],ft[N],sz[N],up[N],cnt[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;
	//cout<<u<<" : "<<st[u]<<" "<<ft[u]<<" "<<up[u]<<endl;
}
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){
	int cnt=0;
	while(up[u]!=up[v]){
		cnt++;
		if(h[up[u]]<h[up[v]]) swap(u,v);
		add(st[up[u]],st[u]+1,id);
		u=par[up[u]];
	}
	if(cnt>lg) assert(0);
	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){
	cnt[u]++;
	if(cnt[u]>2*n) assert(0);
	if(vis[u]) return ;
	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]=cnt[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
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23892 KB Output is correct
2 Correct 11 ms 23892 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 24 ms 23892 KB Output is correct
5 Correct 29 ms 23916 KB Output is correct
6 Correct 13 ms 23892 KB Output is correct
7 Correct 13 ms 23864 KB Output is correct
8 Correct 14 ms 23960 KB Output is correct
9 Correct 51 ms 25244 KB Output is correct
10 Correct 50 ms 43576 KB Output is correct
11 Correct 16 ms 23900 KB Output is correct
12 Correct 48 ms 23912 KB Output is correct
13 Correct 130 ms 48420 KB Output is correct
14 Correct 161 ms 50972 KB Output is correct
15 Execution timed out 5059 ms 49040 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23856 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 13 ms 23892 KB Output is correct
4 Correct 14 ms 23928 KB Output is correct
5 Correct 20 ms 23892 KB Output is correct
6 Correct 19 ms 23892 KB Output is correct
7 Correct 18 ms 23916 KB Output is correct
8 Correct 17 ms 23824 KB Output is correct
9 Correct 13 ms 23852 KB Output is correct
10 Correct 13 ms 23872 KB Output is correct
11 Correct 13 ms 23888 KB Output is correct
12 Correct 13 ms 23868 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23856 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 13 ms 23892 KB Output is correct
4 Correct 14 ms 23928 KB Output is correct
5 Correct 20 ms 23892 KB Output is correct
6 Correct 19 ms 23892 KB Output is correct
7 Correct 18 ms 23916 KB Output is correct
8 Correct 17 ms 23824 KB Output is correct
9 Correct 13 ms 23852 KB Output is correct
10 Correct 13 ms 23872 KB Output is correct
11 Correct 13 ms 23888 KB Output is correct
12 Correct 13 ms 23868 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 15 ms 23892 KB Output is correct
17 Correct 13 ms 23900 KB Output is correct
18 Correct 14 ms 23936 KB Output is correct
19 Correct 16 ms 23892 KB Output is correct
20 Correct 14 ms 23892 KB Output is correct
21 Correct 14 ms 23892 KB Output is correct
22 Correct 17 ms 23908 KB Output is correct
23 Correct 15 ms 23892 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 13 ms 23892 KB Output is correct
26 Correct 13 ms 23920 KB Output is correct
27 Correct 12 ms 23892 KB Output is correct
28 Correct 12 ms 23892 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23856 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 13 ms 23892 KB Output is correct
4 Correct 14 ms 23928 KB Output is correct
5 Correct 20 ms 23892 KB Output is correct
6 Correct 19 ms 23892 KB Output is correct
7 Correct 18 ms 23916 KB Output is correct
8 Correct 17 ms 23824 KB Output is correct
9 Correct 13 ms 23852 KB Output is correct
10 Correct 13 ms 23872 KB Output is correct
11 Correct 13 ms 23888 KB Output is correct
12 Correct 13 ms 23868 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 15 ms 23892 KB Output is correct
17 Correct 13 ms 23900 KB Output is correct
18 Correct 14 ms 23936 KB Output is correct
19 Correct 16 ms 23892 KB Output is correct
20 Correct 14 ms 23892 KB Output is correct
21 Correct 14 ms 23892 KB Output is correct
22 Correct 17 ms 23908 KB Output is correct
23 Correct 15 ms 23892 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 13 ms 23892 KB Output is correct
26 Correct 13 ms 23920 KB Output is correct
27 Correct 12 ms 23892 KB Output is correct
28 Correct 12 ms 23892 KB Output is correct
29 Correct 14 ms 23892 KB Output is correct
30 Correct 19 ms 23952 KB Output is correct
31 Correct 18 ms 23824 KB Output is correct
32 Correct 15 ms 23892 KB Output is correct
33 Correct 16 ms 23868 KB Output is correct
34 Correct 15 ms 23948 KB Output is correct
35 Correct 17 ms 23940 KB Output is correct
36 Correct 15 ms 23884 KB Output is correct
37 Correct 17 ms 23944 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23856 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 13 ms 23892 KB Output is correct
4 Correct 14 ms 23928 KB Output is correct
5 Correct 20 ms 23892 KB Output is correct
6 Correct 19 ms 23892 KB Output is correct
7 Correct 18 ms 23916 KB Output is correct
8 Correct 17 ms 23824 KB Output is correct
9 Correct 13 ms 23852 KB Output is correct
10 Correct 13 ms 23872 KB Output is correct
11 Correct 13 ms 23888 KB Output is correct
12 Correct 13 ms 23868 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23892 KB Output is correct
16 Correct 15 ms 23892 KB Output is correct
17 Correct 13 ms 23900 KB Output is correct
18 Correct 14 ms 23936 KB Output is correct
19 Correct 16 ms 23892 KB Output is correct
20 Correct 14 ms 23892 KB Output is correct
21 Correct 14 ms 23892 KB Output is correct
22 Correct 17 ms 23908 KB Output is correct
23 Correct 15 ms 23892 KB Output is correct
24 Correct 12 ms 23892 KB Output is correct
25 Correct 13 ms 23892 KB Output is correct
26 Correct 13 ms 23920 KB Output is correct
27 Correct 12 ms 23892 KB Output is correct
28 Correct 12 ms 23892 KB Output is correct
29 Correct 14 ms 23892 KB Output is correct
30 Correct 19 ms 23952 KB Output is correct
31 Correct 18 ms 23824 KB Output is correct
32 Correct 15 ms 23892 KB Output is correct
33 Correct 16 ms 23868 KB Output is correct
34 Correct 15 ms 23948 KB Output is correct
35 Correct 17 ms 23940 KB Output is correct
36 Correct 15 ms 23884 KB Output is correct
37 Correct 17 ms 23944 KB Output is correct
38 Correct 70 ms 25236 KB Output is correct
39 Correct 64 ms 43612 KB Output is correct
40 Correct 76 ms 25064 KB Output is correct
41 Correct 54 ms 24932 KB Output is correct
42 Correct 47 ms 25168 KB Output is correct
43 Correct 35 ms 24632 KB Output is correct
44 Correct 24 ms 24128 KB Output is correct
45 Correct 90 ms 34400 KB Output is correct
46 Correct 102 ms 34388 KB Output is correct
47 Correct 72 ms 39060 KB Output is correct
48 Correct 58 ms 39004 KB Output is correct
49 Correct 67 ms 34684 KB Output is correct
50 Correct 69 ms 34604 KB Output is correct
51 Correct 59 ms 35808 KB Output is correct
52 Correct 56 ms 35796 KB Output is correct
53 Correct 22 ms 24788 KB Output is correct
54 Correct 116 ms 34376 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23892 KB Output is correct
2 Correct 15 ms 23756 KB Output is correct
3 Correct 13 ms 23892 KB Output is correct
4 Correct 14 ms 23788 KB Output is correct
5 Correct 19 ms 23880 KB Output is correct
6 Correct 13 ms 23812 KB Output is correct
7 Correct 14 ms 23868 KB Output is correct
8 Correct 13 ms 23892 KB Output is correct
9 Correct 14 ms 23892 KB Output is correct
10 Correct 14 ms 23912 KB Output is correct
11 Correct 13 ms 23804 KB Output is correct
12 Correct 21 ms 23952 KB Output is correct
13 Correct 44 ms 23928 KB Output is correct
14 Correct 55 ms 23912 KB Output is correct
15 Correct 52 ms 23936 KB Output is correct
16 Correct 127 ms 35972 KB Output is correct
17 Correct 262 ms 43836 KB Output is correct
18 Correct 499 ms 55572 KB Output is correct
19 Correct 166 ms 37532 KB Output is correct
20 Correct 161 ms 37520 KB Output is correct
21 Correct 165 ms 37508 KB Output is correct
22 Correct 239 ms 42844 KB Output is correct
23 Correct 180 ms 41876 KB Output is correct
24 Correct 205 ms 41988 KB Output is correct
25 Correct 194 ms 42056 KB Output is correct
26 Correct 162 ms 42060 KB Output is correct
27 Correct 247 ms 42732 KB Output is correct
28 Correct 286 ms 49868 KB Output is correct
29 Correct 242 ms 44872 KB Output is correct
30 Correct 160 ms 48532 KB Output is correct
31 Correct 192 ms 50708 KB Output is correct
32 Correct 145 ms 41668 KB Output is correct
33 Correct 139 ms 44056 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23892 KB Output is correct
2 Correct 11 ms 23892 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 24 ms 23892 KB Output is correct
5 Correct 29 ms 23916 KB Output is correct
6 Correct 13 ms 23892 KB Output is correct
7 Correct 13 ms 23864 KB Output is correct
8 Correct 14 ms 23960 KB Output is correct
9 Correct 51 ms 25244 KB Output is correct
10 Correct 50 ms 43576 KB Output is correct
11 Correct 16 ms 23900 KB Output is correct
12 Correct 48 ms 23912 KB Output is correct
13 Correct 130 ms 48420 KB Output is correct
14 Correct 161 ms 50972 KB Output is correct
15 Execution timed out 5059 ms 49040 KB Time limit exceeded
16 Halted 0 ms 0 KB -