oj.uz

Submission #815115

# Submission time Handle Problem Language Result Execution time Memory
815115 2023-08-08T12:28:19 Z WonderfulWhale Jail (JOI22_jail) C++17
72 / 100
 3819 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<unordered_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<unordered_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].erase(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 3 ms 5972 KB Output is correct
2 Correct 3 ms 5972 KB Output is correct
3 Correct 3 ms 5976 KB Output is correct
4 Correct 14 ms 6176 KB Output is correct
5 Correct 28 ms 6180 KB Output is correct
6 Correct 4 ms 6228 KB Output is correct
7 Correct 4 ms 6228 KB Output is correct
8 Correct 6 ms 6412 KB Output is correct
9 Correct 51 ms 12736 KB Output is correct
10 Correct 72 ms 74264 KB Output is correct
11 Correct 10 ms 5972 KB Output is correct
12 Correct 52 ms 6184 KB Output is correct
13 Correct 338 ms 162244 KB Output is correct
14 Correct 419 ms 167444 KB Output is correct
15 Correct 939 ms 176708 KB Output is correct
16 Correct 2782 ms 291564 KB Output is correct
17 Correct 454 ms 200880 KB Output is correct
18 Correct 554 ms 223336 KB Output is correct
19 Correct 416 ms 190700 KB Output is correct
20 Correct 473 ms 189060 KB Output is correct
21 Runtime error 3819 ms 1048576 KB Execution killed with signal 9
22 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 3 ms 5972 KB Output is correct
3 Correct 4 ms 6228 KB Output is correct
4 Correct 4 ms 6228 KB Output is correct
5 Correct 4 ms 6228 KB Output is correct
6 Correct 4 ms 6228 KB Output is correct
7 Correct 4 ms 6228 KB Output is correct
8 Correct 4 ms 6232 KB Output is correct
9 Correct 4 ms 6236 KB Output is correct
10 Correct 4 ms 6228 KB Output is correct
11 Correct 4 ms 6228 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 3 ms 5972 KB Output is correct
3 Correct 4 ms 6228 KB Output is correct
4 Correct 4 ms 6228 KB Output is correct
5 Correct 4 ms 6228 KB Output is correct
6 Correct 4 ms 6228 KB Output is correct
7 Correct 4 ms 6228 KB Output is correct
8 Correct 4 ms 6232 KB Output is correct
9 Correct 4 ms 6236 KB Output is correct
10 Correct 4 ms 6228 KB Output is correct
11 Correct 4 ms 6228 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 2 ms 5972 KB Output is correct
16 Correct 4 ms 6228 KB Output is correct
17 Correct 4 ms 6228 KB Output is correct
18 Correct 4 ms 6228 KB Output is correct
19 Correct 3 ms 5984 KB Output is correct
20 Correct 4 ms 6264 KB Output is correct
21 Correct 4 ms 6228 KB Output is correct
22 Correct 4 ms 6168 KB Output is correct
23 Correct 4 ms 5972 KB Output is correct
24 Correct 3 ms 6100 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 3 ms 6100 KB Output is correct
27 Correct 4 ms 6228 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 3 ms 5972 KB Output is correct
3 Correct 4 ms 6228 KB Output is correct
4 Correct 4 ms 6228 KB Output is correct
5 Correct 4 ms 6228 KB Output is correct
6 Correct 4 ms 6228 KB Output is correct
7 Correct 4 ms 6228 KB Output is correct
8 Correct 4 ms 6232 KB Output is correct
9 Correct 4 ms 6236 KB Output is correct
10 Correct 4 ms 6228 KB Output is correct
11 Correct 4 ms 6228 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 2 ms 5972 KB Output is correct
16 Correct 4 ms 6228 KB Output is correct
17 Correct 4 ms 6228 KB Output is correct
18 Correct 4 ms 6228 KB Output is correct
19 Correct 3 ms 5984 KB Output is correct
20 Correct 4 ms 6264 KB Output is correct
21 Correct 4 ms 6228 KB Output is correct
22 Correct 4 ms 6168 KB Output is correct
23 Correct 4 ms 5972 KB Output is correct
24 Correct 3 ms 6100 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 3 ms 6100 KB Output is correct
27 Correct 4 ms 6228 KB Output is correct
28 Correct 3 ms 5972 KB Output is correct
29 Correct 6 ms 6356 KB Output is correct
30 Correct 5 ms 6356 KB Output is correct
31 Correct 7 ms 6312 KB Output is correct
32 Correct 7 ms 6228 KB Output is correct
33 Correct 4 ms 6228 KB Output is correct
34 Correct 5 ms 6228 KB Output is correct
35 Correct 6 ms 6268 KB Output is correct
36 Correct 5 ms 6228 KB Output is correct
37 Correct 5 ms 6276 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 3 ms 5972 KB Output is correct
3 Correct 4 ms 6228 KB Output is correct
4 Correct 4 ms 6228 KB Output is correct
5 Correct 4 ms 6228 KB Output is correct
6 Correct 4 ms 6228 KB Output is correct
7 Correct 4 ms 6228 KB Output is correct
8 Correct 4 ms 6232 KB Output is correct
9 Correct 4 ms 6236 KB Output is correct
10 Correct 4 ms 6228 KB Output is correct
11 Correct 4 ms 6228 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 2 ms 5972 KB Output is correct
16 Correct 4 ms 6228 KB Output is correct
17 Correct 4 ms 6228 KB Output is correct
18 Correct 4 ms 6228 KB Output is correct
19 Correct 3 ms 5984 KB Output is correct
20 Correct 4 ms 6264 KB Output is correct
21 Correct 4 ms 6228 KB Output is correct
22 Correct 4 ms 6168 KB Output is correct
23 Correct 4 ms 5972 KB Output is correct
24 Correct 3 ms 6100 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 3 ms 6100 KB Output is correct
27 Correct 4 ms 6228 KB Output is correct
28 Correct 3 ms 5972 KB Output is correct
29 Correct 6 ms 6356 KB Output is correct
30 Correct 5 ms 6356 KB Output is correct
31 Correct 7 ms 6312 KB Output is correct
32 Correct 7 ms 6228 KB Output is correct
33 Correct 4 ms 6228 KB Output is correct
34 Correct 5 ms 6228 KB Output is correct
35 Correct 6 ms 6268 KB Output is correct
36 Correct 5 ms 6228 KB Output is correct
37 Correct 5 ms 6276 KB Output is correct
38 Correct 54 ms 12740 KB Output is correct
39 Correct 72 ms 74208 KB Output is correct
40 Correct 60 ms 12592 KB Output is correct
41 Correct 73 ms 12488 KB Output is correct
42 Correct 59 ms 12632 KB Output is correct
43 Correct 34 ms 10232 KB Output is correct
44 Correct 26 ms 7500 KB Output is correct
45 Correct 101 ms 66508 KB Output is correct
46 Correct 105 ms 66492 KB Output is correct
47 Correct 83 ms 70776 KB Output is correct
48 Correct 82 ms 70756 KB Output is correct
49 Correct 91 ms 67092 KB Output is correct
50 Correct 84 ms 66848 KB Output is correct
51 Correct 73 ms 66380 KB Output is correct
52 Correct 72 ms 66304 KB Output is correct
53 Correct 26 ms 13388 KB Output is correct
54 Correct 113 ms 66540 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5972 KB Output is correct
2 Correct 3 ms 5968 KB Output is correct
3 Correct 3 ms 5972 KB Output is correct
4 Correct 3 ms 5972 KB Output is correct
5 Correct 11 ms 6048 KB Output is correct
6 Correct 3 ms 6100 KB Output is correct
7 Correct 4 ms 6100 KB Output is correct
8 Correct 3 ms 5972 KB Output is correct
9 Correct 3 ms 5972 KB Output is correct
10 Correct 3 ms 6100 KB Output is correct
11 Correct 3 ms 6004 KB Output is correct
12 Correct 5 ms 6228 KB Output is correct
13 Correct 34 ms 6176 KB Output is correct
14 Correct 56 ms 6180 KB Output is correct
15 Correct 46 ms 6216 KB Output is correct
16 Correct 213 ms 87388 KB Output is correct
17 Correct 1161 ms 174476 KB Output is correct
18 Correct 2629 ms 271344 KB Output is correct
19 Correct 481 ms 108188 KB Output is correct
20 Correct 357 ms 108644 KB Output is correct
21 Correct 517 ms 108720 KB Output is correct
22 Correct 1067 ms 175536 KB Output is correct
23 Correct 672 ms 175620 KB Output is correct
24 Correct 772 ms 175928 KB Output is correct
25 Correct 657 ms 176488 KB Output is correct
26 Correct 813 ms 176712 KB Output is correct
27 Correct 2111 ms 222464 KB Output is correct
28 Correct 1589 ms 227996 KB Output is correct
29 Correct 1554 ms 216152 KB Output is correct
30 Correct 1047 ms 159980 KB Output is correct
31 Correct 807 ms 162216 KB Output is correct
32 Correct 1035 ms 157464 KB Output is correct
33 Correct 769 ms 160260 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5972 KB Output is correct
2 Correct 3 ms 5972 KB Output is correct
3 Correct 3 ms 5976 KB Output is correct
4 Correct 14 ms 6176 KB Output is correct
5 Correct 28 ms 6180 KB Output is correct
6 Correct 4 ms 6228 KB Output is correct
7 Correct 4 ms 6228 KB Output is correct
8 Correct 6 ms 6412 KB Output is correct
9 Correct 51 ms 12736 KB Output is correct
10 Correct 72 ms 74264 KB Output is correct
11 Correct 10 ms 5972 KB Output is correct
12 Correct 52 ms 6184 KB Output is correct
13 Correct 338 ms 162244 KB Output is correct
14 Correct 419 ms 167444 KB Output is correct
15 Correct 939 ms 176708 KB Output is correct
16 Correct 2782 ms 291564 KB Output is correct
17 Correct 454 ms 200880 KB Output is correct
18 Correct 554 ms 223336 KB Output is correct
19 Correct 416 ms 190700 KB Output is correct
20 Correct 473 ms 189060 KB Output is correct
21 Runtime error 3819 ms 1048576 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -