oj.uz

Submission #815048

# Submission time Handle Problem Language Result Execution time Memory
815048 2023-08-08T11:59:59 Z WonderfulWhale Jail (JOI22_jail) C++17
72 / 100
 4778 ms 1048576 KB 
//#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
#define int int64_t
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
 
int Gg = 0;
 
struct SegTree {
	int T=1;
	vector<set<int>> t;
	void build(int n) {
		T=1;
		while(T<=n) T*=2;
		t.resize(2*T);
		for(int i=0;i<2*T;i++) t[i].clear();
	}
	vector<int> query(int l, int r) {
		l+=T, r+=T;
		vector<int> ret;
		for(int x:t[l]) ret.pb(x);
		if(l!=r) for(int x:t[r]) ret.pb(x);
		while(l/2!=r/2) {
			if(l%2==0) for(int x:t[l+1]) ret.pb(x);
			if(r%2==1) for(int x:t[r-1]) ret.pb(x);
			l/=2;
			r/=2;
		}
		return ret;
	}
	void add(int x, int val) {
		x+=T;
		while(x) {
			t[x].insert(val);
			x/=2;
		}
	}
	void remove(int x, int val) {
		x+=T;
		while(x) {
			t[x].erase(val);
			x/=2;
		}
	}
};
struct SegTree2 {
	int T = 1;
	vector<set<int>> t;
	void build(int n) {
		T=1;
		while(T<=n) T*=2;
		t.resize(2*T);
		for(int i=0;i<2*T;i++) t[i].clear();
	}
	void add(int l, int r, int val) {
		l+=T, r+=T;
		t[l].insert(val);
		if(l!=r) t[r].insert(val);
		while(l/2!=r/2) {
			if(l%2==0) t[l+1].insert(val);
			if(r%2==1) t[r-1].insert(val);
			l/=2;
			r/=2;
		}
	}
	void remove(int l, int r, int val) {
		l+=T, r+=T;
		t[l].erase(val);
		if(l!=r) t[r].insert(val);
		while(l/2!=r/2) {
			if(l%2==0) t[l+1].erase(val);
			if(r%2==1) t[r-1].erase(val);
			l/=2;
			r/=2;
		}
	}
	vector<int> query(int x) {
		vector<int> ret;
		x+=T;
		while(x) {
			for(int y:t[x]) ret.pb(y);
			x/=2;
		}
		return ret;
	}
};
 
vector<int> G[120009];
vector<int> G2[120009];
int tin[120009], tout[120009], T;
int jp2[120009][20];
int deg[120009];
pii tab[120009];
int col[120009];
int dep[120009];
int p[120009];
int heavy[120009];
int pos[120009], P;
int head[120009];
 
 
int dfs(int x, int y) {
	p[x] = y;
	dep[x] = dep[y]+1;
	int sz = 1, max_sz=0;
	tin[x] = ++T;
	jp2[x][0] = y;
	for(int i=1;i<20;i++) jp2[x][i] = jp2[jp2[x][i-1]][i-1];
	for(int z:G[x]) if(z!=y) {
		int c_sz = dfs(z, x);
		sz += c_sz;
		if(c_sz>max_sz) {
			max_sz = c_sz;
			heavy[x] = z;
		} 
	}
	tout[x] = ++T;
	return sz;
}
 
void decompose(int x, int h) {
	head[x] = h;
	pos[x] = ++P;
	if(heavy[x]) {
		decompose(heavy[x], h);
	}
	for(int y:G[x]) {
		if(y!=p[x]&&y!=heavy[x]) decompose(y, y);
	}
}
 
bool is_ancestor(int x, int y) {
    	return tin[x]<=tin[y]&&tout[x]>=tout[y];
    }
     
    int lca(int x, int y) {
    	if(is_ancestor(x, y)) return x;
    	if(is_ancestor(y, x)) return y;
    	for(int i=19;i>=0;i--) {
    		if(!is_ancestor(jp2[x][i], y)) {
    			x = jp2[x][i];
    		}
    	}
    	return jp2[x][0];
    }
     
    bool is_on_path(int x, int a, int b) {
    	return is_ancestor(a, x)&&is_ancestor(x, b);
    }
     
    bool f(int x, int a, int b) {
    	int y = lca(a, b);
    	//cerr << "lca: " << a << " " << b << " " << y << "\n";
    	//cerr << "checking: " << x << " " << a << " " << b << " " << (is_on_path(x, y, a)||is_on_path(x, y, b)) << "\n";
    	return is_on_path(x, y, a)||is_on_path(x, y, b);
    }
     
    SegTree seg1;
    SegTree2 seg2;
     
    vector<int> hld_query(int a, int b) {
    	//cout << "hld_query: " << a << " " << b << "\n";
    	vector<int> ret;
    	for (; head[a] != head[b]; b=p[head[b]]) {
    		if (dep[head[a]] > dep[head[b]]) swap(a, b);
    		for(int x:seg1.query(pos[head[b]], pos[b])) ret.pb(x);
    	}
    	if (dep[a] > dep[b]) swap(a, b);
    	for(int x:seg1.query(pos[a], pos[b])) ret.pb(x);
    	return ret;
    }
     
    void hld_add(int a, int b, int val) {
    	//cout << "hld_query: " << a << " " << b << "\n";
    	vector<int> ret;
    	for (; head[a] != head[b]; b=p[head[b]]) {
    		if (dep[head[a]] > dep[head[b]]) swap(a, b);
    		seg2.add(pos[head[b]], pos[b], val);
    	}
    	if (dep[a] > dep[b]) swap(a, b);
    	seg2.add(pos[a], pos[b], val);
    }
     
    void hld_remove(int a, int b, int val) {
    	//cout << "hld_query: " << a << " " << b << "\n";
    	vector<int> ret;
    	for (; head[a] != head[b]; b=p[head[b]]) {
    		if (dep[head[a]] > dep[head[b]]) swap(a, b);
    		seg2.remove(pos[head[b]], pos[b], val);
    	}
    	if (dep[a] > dep[b]) swap(a, b);
    	seg2.remove(pos[a], pos[b], val);
    }
     
    int N;
     
    bool dfs2(int x) {
    	assert(col[x]==0);
    	col[x] = 1;
    	vector<int> v1 = hld_query(tab[x].st, tab[x].nd);
    	Gg += sz(v1);
    	//assert(Gg<=2*N);
    	for(int y:v1){ 
    		if(y==x) continue;
    		if(col[y]==1) return false;
    	}
    	for(int y:v1) {
    		if(y==x) continue;
    		if(col[y]==1) return false;
    		if(col[y]==0&&!dfs2(y)) return false;
    	}
    	vector<int> v2 = seg2.query(pos[tab[x].nd]);
    	Gg += sz(v2);
    	//assert(Gg<=2*N);
    	for(int y:v2) {
    		if(y==x) continue;
    		if(col[y]==1) return false;
    	}
    	for(int y:v2) {
    		if(y==x) continue;
    		if(col[y]==1) return false;
    		if(col[y]==0&&!dfs2(y)) return false;
    	}
    	col[x] = 2;
    	seg1.remove(pos[tab[x].st], x);
    	hld_remove(tab[x].st, tab[x].nd, x);
    	return true;
    }
     
    int32_t main() {
    	ios_base::sync_with_stdio(false);
    	cin.tie(NULL);
     
    	int q=1;
    	cin >> q;
    	while(q--) {
    		int n, m;
    		cin >> n;
    		N = n;
    		Gg=0;
    		for(int i=1;i<=n;i++) {
    			G[i].clear();
    			head[i] = 0;
    			heavy[i] = 0;
    			dep[i] = 0;
    			p[i] = 0;
    		}
    		for(int i=0;i<n-1;i++) {
    			int a, b;
    			cin >> a >> b;
    			G[a].pb(b);
    			G[b].pb(a);
    		}
    		tin[0] = T = 0;
    		dfs(1, 0);
    		P = 0;
    		decompose(1, 1);
    		tout[0] = T;
    		cin >> m;
    		for(int i=0;i<m;i++) {
    			G2[i].clear();
    			deg[i] = 0;
    			col[i] = 0;
    		}
    		seg1.build(n+9);
    		seg2.build(n+9);
    		for(int i=0;i<m;i++) {
    			cin >> tab[i].st >> tab[i].nd;
    			seg1.add(pos[tab[i].st], i);
    			hld_add(tab[i].st, tab[i].nd, i);
    		}
    		bool ans = true;
    		for(int i=0;i<m;i++) {
				if(!ans) continue;
    			if(!col[i]) {
    				ans&=dfs2(i);
    			}
    		}
    		if(ans) {
    			cout << "Yes\n";
    		} else {
    			cout << "No\n";
    		}
    	}
    }

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5972 KB Output is correct
2 Correct 3 ms 5972 KB Output is correct
3 Correct 2 ms 5972 KB Output is correct
4 Correct 15 ms 6116 KB Output is correct
5 Correct 38 ms 6000 KB Output is correct
6 Correct 5 ms 6100 KB Output is correct
7 Correct 5 ms 6200 KB Output is correct
8 Correct 8 ms 6276 KB Output is correct
9 Correct 52 ms 11508 KB Output is correct
10 Correct 96 ms 71288 KB Output is correct
11 Correct 14 ms 6040 KB Output is correct
12 Correct 62 ms 6128 KB Output is correct
13 Correct 307 ms 131688 KB Output is correct
14 Correct 318 ms 136500 KB Output is correct
15 Correct 806 ms 152952 KB Output is correct
16 Correct 3051 ms 271096 KB Output is correct
17 Runtime error 4778 ms 1048576 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5972 KB Output is correct
2 Correct 4 ms 5972 KB Output is correct
3 Correct 4 ms 6100 KB Output is correct
4 Correct 4 ms 6100 KB Output is correct
5 Correct 4 ms 6100 KB Output is correct
6 Correct 4 ms 6100 KB Output is correct
7 Correct 4 ms 6100 KB Output is correct
8 Correct 4 ms 6200 KB Output is correct
9 Correct 6 ms 6100 KB Output is correct
10 Correct 4 ms 6100 KB Output is correct
11 Correct 3 ms 6100 KB Output is correct
12 Correct 3 ms 6100 KB Output is correct
13 Correct 3 ms 6100 KB Output is correct
14 Correct 3 ms 5972 KB Output is correct
15 Correct 3 ms 5972 KB Output is correct
16 Correct 4 ms 6100 KB Output is correct
17 Correct 5 ms 6100 KB Output is correct
18 Correct 6 ms 6204 KB Output is correct
19 Correct 3 ms 5972 KB Output is correct
20 Correct 4 ms 6208 KB Output is correct
21 Correct 4 ms 6228 KB Output is correct
22 Correct 5 ms 6240 KB Output is correct
23 Correct 3 ms 5972 KB Output is correct
24 Correct 4 ms 6100 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 3 ms 6096 KB Output is correct
27 Correct 4 ms 6208 KB Output is correct
28 Correct 3 ms 5972 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5972 KB Output is correct
2 Correct 4 ms 5972 KB Output is correct
3 Correct 4 ms 6100 KB Output is correct
4 Correct 4 ms 6100 KB Output is correct
5 Correct 4 ms 6100 KB Output is correct
6 Correct 4 ms 6100 KB Output is correct
7 Correct 4 ms 6100 KB Output is correct
8 Correct 4 ms 6200 KB Output is correct
9 Correct 6 ms 6100 KB Output is correct
10 Correct 4 ms 6100 KB Output is correct
11 Correct 3 ms 6100 KB Output is correct
12 Correct 3 ms 6100 KB Output is correct
13 Correct 3 ms 6100 KB Output is correct
14 Correct 3 ms 5972 KB Output is correct
15 Correct 3 ms 5972 KB Output is correct
16 Correct 4 ms 6100 KB Output is correct
17 Correct 5 ms 6100 KB Output is correct
18 Correct 6 ms 6204 KB Output is correct
19 Correct 3 ms 5972 KB Output is correct
20 Correct 4 ms 6208 KB Output is correct
21 Correct 4 ms 6228 KB Output is correct
22 Correct 5 ms 6240 KB Output is correct
23 Correct 3 ms 5972 KB Output is correct
24 Correct 4 ms 6100 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 3 ms 6096 KB Output is correct
27 Correct 4 ms 6208 KB Output is correct
28 Correct 3 ms 5972 KB Output is correct
29 Correct 6 ms 6356 KB Output is correct
30 Correct 6 ms 6304 KB Output is correct
31 Correct 9 ms 6228 KB Output is correct
32 Correct 6 ms 6228 KB Output is correct
33 Correct 5 ms 6228 KB Output is correct
34 Correct 11 ms 6272 KB Output is correct
35 Correct 7 ms 6284 KB Output is correct
36 Correct 7 ms 6228 KB Output is correct
37 Correct 7 ms 6228 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5972 KB Output is correct
2 Correct 4 ms 5972 KB Output is correct
3 Correct 4 ms 6100 KB Output is correct
4 Correct 4 ms 6100 KB Output is correct
5 Correct 4 ms 6100 KB Output is correct
6 Correct 4 ms 6100 KB Output is correct
7 Correct 4 ms 6100 KB Output is correct
8 Correct 4 ms 6200 KB Output is correct
9 Correct 6 ms 6100 KB Output is correct
10 Correct 4 ms 6100 KB Output is correct
11 Correct 3 ms 6100 KB Output is correct
12 Correct 3 ms 6100 KB Output is correct
13 Correct 3 ms 6100 KB Output is correct
14 Correct 3 ms 5972 KB Output is correct
15 Correct 3 ms 5972 KB Output is correct
16 Correct 4 ms 6100 KB Output is correct
17 Correct 5 ms 6100 KB Output is correct
18 Correct 6 ms 6204 KB Output is correct
19 Correct 3 ms 5972 KB Output is correct
20 Correct 4 ms 6208 KB Output is correct
21 Correct 4 ms 6228 KB Output is correct
22 Correct 5 ms 6240 KB Output is correct
23 Correct 3 ms 5972 KB Output is correct
24 Correct 4 ms 6100 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 3 ms 6096 KB Output is correct
27 Correct 4 ms 6208 KB Output is correct
28 Correct 3 ms 5972 KB Output is correct
29 Correct 6 ms 6356 KB Output is correct
30 Correct 6 ms 6304 KB Output is correct
31 Correct 9 ms 6228 KB Output is correct
32 Correct 6 ms 6228 KB Output is correct
33 Correct 5 ms 6228 KB Output is correct
34 Correct 11 ms 6272 KB Output is correct
35 Correct 7 ms 6284 KB Output is correct
36 Correct 7 ms 6228 KB Output is correct
37 Correct 7 ms 6228 KB Output is correct
38 Correct 51 ms 12524 KB Output is correct
39 Correct 83 ms 72696 KB Output is correct
40 Correct 57 ms 11096 KB Output is correct
41 Correct 90 ms 10952 KB Output is correct
42 Correct 59 ms 11268 KB Output is correct
43 Correct 34 ms 10316 KB Output is correct
44 Correct 36 ms 7312 KB Output is correct
45 Correct 124 ms 62800 KB Output is correct
46 Correct 121 ms 62748 KB Output is correct
47 Correct 89 ms 67012 KB Output is correct
48 Correct 92 ms 67028 KB Output is correct
49 Correct 86 ms 62920 KB Output is correct
50 Correct 90 ms 62976 KB Output is correct
51 Correct 89 ms 63268 KB Output is correct
52 Correct 81 ms 63364 KB Output is correct
53 Correct 29 ms 12672 KB Output is correct
54 Correct 132 ms 63248 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5972 KB Output is correct
2 Correct 3 ms 5972 KB Output is correct
3 Correct 3 ms 5972 KB Output is correct
4 Correct 3 ms 6016 KB Output is correct
5 Correct 11 ms 6060 KB Output is correct
6 Correct 3 ms 6100 KB Output is correct
7 Correct 4 ms 6100 KB Output is correct
8 Correct 4 ms 5972 KB Output is correct
9 Correct 4 ms 5972 KB Output is correct
10 Correct 4 ms 6100 KB Output is correct
11 Correct 3 ms 5972 KB Output is correct
12 Correct 6 ms 6228 KB Output is correct
13 Correct 43 ms 6204 KB Output is correct
14 Correct 67 ms 6860 KB Output is correct
15 Correct 59 ms 6780 KB Output is correct
16 Correct 225 ms 77920 KB Output is correct
17 Correct 1274 ms 158100 KB Output is correct
18 Correct 2941 ms 258732 KB Output is correct
19 Correct 540 ms 94604 KB Output is correct
20 Correct 331 ms 95028 KB Output is correct
21 Correct 645 ms 94984 KB Output is correct
22 Correct 1135 ms 160620 KB Output is correct
23 Correct 592 ms 160392 KB Output is correct
24 Correct 793 ms 161372 KB Output is correct
25 Correct 612 ms 161080 KB Output is correct
26 Correct 918 ms 161896 KB Output is correct
27 Correct 2535 ms 201064 KB Output is correct
28 Correct 1479 ms 207060 KB Output is correct
29 Correct 1487 ms 194284 KB Output is correct
30 Correct 1156 ms 135704 KB Output is correct
31 Correct 636 ms 138060 KB Output is correct
32 Correct 1036 ms 133220 KB Output is correct
33 Correct 694 ms 136228 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5972 KB Output is correct
2 Correct 3 ms 5972 KB Output is correct
3 Correct 2 ms 5972 KB Output is correct
4 Correct 15 ms 6116 KB Output is correct
5 Correct 38 ms 6000 KB Output is correct
6 Correct 5 ms 6100 KB Output is correct
7 Correct 5 ms 6200 KB Output is correct
8 Correct 8 ms 6276 KB Output is correct
9 Correct 52 ms 11508 KB Output is correct
10 Correct 96 ms 71288 KB Output is correct
11 Correct 14 ms 6040 KB Output is correct
12 Correct 62 ms 6128 KB Output is correct
13 Correct 307 ms 131688 KB Output is correct
14 Correct 318 ms 136500 KB Output is correct
15 Correct 806 ms 152952 KB Output is correct
16 Correct 3051 ms 271096 KB Output is correct
17 Runtime error 4778 ms 1048576 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -