oj.uz

Submission #814868

# Submission time Handle Problem Language Result Execution time Memory
814868 2023-08-08T10:48:25 Z WonderfulWhale Jail (JOI22_jail) C++17
61 / 100
 5000 ms 85016 KB 
#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()

struct SegTree {
	static const int T = 1<<17;
	set<int> t[2*T];
	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 {
	static const int T = 1<<17;
	set<int> t[2*T];
	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);
		//cout << x << " " << z << " " << c_sz << "\n";
		//cout << max_sz << "\n";
		sz += c_sz;
		if(c_sz>max_sz) {
			max_sz = c_sz;
			//cout << "setting heavy to: " << z << "\n";
			heavy[x] = z;
		}
	}
	tout[x] = ++T;
	return sz;
}

void decompose(int x, int h) {
	head[x] = h;
	pos[x] = ++P;
	//cout << "pos: " << x << " " << pos[x] << "\n";
	//cout << heavy[x] << "\n";
	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);
}

bool dfs2(int x) {
	//cout << "dfs: " << x << "\n";
	col[x] = 1;
	vector<int> v1 = hld_query(tab[x].st, tab[x].nd);
	for(int y:v1){ 
		if(y==x) continue;
		//cout << "sprawdzam1: "<< y << "\n";
		if(col[y]==1) return false;
	}
	for(int y:v1) {
		if(y==x) continue;
		if(!dfs2(y)) return false;
	}
	//cout << "v2 dla: "<< tab[x].nd << "\n";
	vector<int> v2 = seg2.query(pos[tab[x].nd]);
	for(int y:v2) {
		if(y==x) continue;
		//cout << "sprawdzam2: "<< y << "\n";
		if(col[y]==1) return false;
	}
	for(int y:v2) {
		if(y==x) continue;
		if(!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;
		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);
		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 = SegTree();
		seg2 = SegTree2();
		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(!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 26 ms 42836 KB Output is correct
2 Correct 37 ms 42964 KB Output is correct
3 Correct 26 ms 42884 KB Output is correct
4 Correct 2604 ms 43220 KB Output is correct
5 Execution timed out 5046 ms 43608 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 42964 KB Output is correct
2 Correct 27 ms 42964 KB Output is correct
3 Correct 133 ms 43064 KB Output is correct
4 Correct 135 ms 43052 KB Output is correct
5 Correct 160 ms 43060 KB Output is correct
6 Correct 140 ms 43056 KB Output is correct
7 Correct 148 ms 43056 KB Output is correct
8 Correct 139 ms 42964 KB Output is correct
9 Correct 136 ms 43180 KB Output is correct
10 Correct 139 ms 43056 KB Output is correct
11 Correct 119 ms 43048 KB Output is correct
12 Correct 130 ms 43028 KB Output is correct
13 Correct 141 ms 43032 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 42964 KB Output is correct
2 Correct 27 ms 42964 KB Output is correct
3 Correct 133 ms 43064 KB Output is correct
4 Correct 135 ms 43052 KB Output is correct
5 Correct 160 ms 43060 KB Output is correct
6 Correct 140 ms 43056 KB Output is correct
7 Correct 148 ms 43056 KB Output is correct
8 Correct 139 ms 42964 KB Output is correct
9 Correct 136 ms 43180 KB Output is correct
10 Correct 139 ms 43056 KB Output is correct
11 Correct 119 ms 43048 KB Output is correct
12 Correct 130 ms 43028 KB Output is correct
13 Correct 141 ms 43032 KB Output is correct
14 Correct 31 ms 42944 KB Output is correct
15 Correct 38 ms 42948 KB Output is correct
16 Correct 135 ms 43068 KB Output is correct
17 Correct 143 ms 42964 KB Output is correct
18 Correct 150 ms 43060 KB Output is correct
19 Correct 131 ms 42952 KB Output is correct
20 Correct 153 ms 43060 KB Output is correct
21 Correct 140 ms 43068 KB Output is correct
22 Correct 140 ms 43080 KB Output is correct
23 Correct 136 ms 42952 KB Output is correct
24 Correct 144 ms 42956 KB Output is correct
25 Correct 136 ms 43056 KB Output is correct
26 Correct 135 ms 42956 KB Output is correct
27 Correct 135 ms 43004 KB Output is correct
28 Correct 156 ms 42956 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 42964 KB Output is correct
2 Correct 27 ms 42964 KB Output is correct
3 Correct 133 ms 43064 KB Output is correct
4 Correct 135 ms 43052 KB Output is correct
5 Correct 160 ms 43060 KB Output is correct
6 Correct 140 ms 43056 KB Output is correct
7 Correct 148 ms 43056 KB Output is correct
8 Correct 139 ms 42964 KB Output is correct
9 Correct 136 ms 43180 KB Output is correct
10 Correct 139 ms 43056 KB Output is correct
11 Correct 119 ms 43048 KB Output is correct
12 Correct 130 ms 43028 KB Output is correct
13 Correct 141 ms 43032 KB Output is correct
14 Correct 31 ms 42944 KB Output is correct
15 Correct 38 ms 42948 KB Output is correct
16 Correct 135 ms 43068 KB Output is correct
17 Correct 143 ms 42964 KB Output is correct
18 Correct 150 ms 43060 KB Output is correct
19 Correct 131 ms 42952 KB Output is correct
20 Correct 153 ms 43060 KB Output is correct
21 Correct 140 ms 43068 KB Output is correct
22 Correct 140 ms 43080 KB Output is correct
23 Correct 136 ms 42952 KB Output is correct
24 Correct 144 ms 42956 KB Output is correct
25 Correct 136 ms 43056 KB Output is correct
26 Correct 135 ms 42956 KB Output is correct
27 Correct 135 ms 43004 KB Output is correct
28 Correct 156 ms 42956 KB Output is correct
29 Correct 143 ms 43192 KB Output is correct
30 Correct 140 ms 43188 KB Output is correct
31 Correct 173 ms 43108 KB Output is correct
32 Correct 138 ms 43092 KB Output is correct
33 Correct 147 ms 43084 KB Output is correct
34 Correct 142 ms 43168 KB Output is correct
35 Correct 163 ms 43336 KB Output is correct
36 Correct 156 ms 43152 KB Output is correct
37 Correct 162 ms 43108 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 42964 KB Output is correct
2 Correct 27 ms 42964 KB Output is correct
3 Correct 133 ms 43064 KB Output is correct
4 Correct 135 ms 43052 KB Output is correct
5 Correct 160 ms 43060 KB Output is correct
6 Correct 140 ms 43056 KB Output is correct
7 Correct 148 ms 43056 KB Output is correct
8 Correct 139 ms 42964 KB Output is correct
9 Correct 136 ms 43180 KB Output is correct
10 Correct 139 ms 43056 KB Output is correct
11 Correct 119 ms 43048 KB Output is correct
12 Correct 130 ms 43028 KB Output is correct
13 Correct 141 ms 43032 KB Output is correct
14 Correct 31 ms 42944 KB Output is correct
15 Correct 38 ms 42948 KB Output is correct
16 Correct 135 ms 43068 KB Output is correct
17 Correct 143 ms 42964 KB Output is correct
18 Correct 150 ms 43060 KB Output is correct
19 Correct 131 ms 42952 KB Output is correct
20 Correct 153 ms 43060 KB Output is correct
21 Correct 140 ms 43068 KB Output is correct
22 Correct 140 ms 43080 KB Output is correct
23 Correct 136 ms 42952 KB Output is correct
24 Correct 144 ms 42956 KB Output is correct
25 Correct 136 ms 43056 KB Output is correct
26 Correct 135 ms 42956 KB Output is correct
27 Correct 135 ms 43004 KB Output is correct
28 Correct 156 ms 42956 KB Output is correct
29 Correct 143 ms 43192 KB Output is correct
30 Correct 140 ms 43188 KB Output is correct
31 Correct 173 ms 43108 KB Output is correct
32 Correct 138 ms 43092 KB Output is correct
33 Correct 147 ms 43084 KB Output is correct
34 Correct 142 ms 43168 KB Output is correct
35 Correct 163 ms 43336 KB Output is correct
36 Correct 156 ms 43152 KB Output is correct
37 Correct 162 ms 43108 KB Output is correct
38 Correct 289 ms 48128 KB Output is correct
39 Correct 135 ms 85016 KB Output is correct
40 Correct 243 ms 46692 KB Output is correct
41 Correct 265 ms 46656 KB Output is correct
42 Correct 232 ms 46796 KB Output is correct
43 Correct 172 ms 45928 KB Output is correct
44 Correct 204 ms 44196 KB Output is correct
45 Correct 112 ms 75204 KB Output is correct
46 Correct 114 ms 75188 KB Output is correct
47 Correct 86 ms 79496 KB Output is correct
48 Correct 86 ms 79436 KB Output is correct
49 Correct 92 ms 75440 KB Output is correct
50 Correct 96 ms 75444 KB Output is correct
51 Correct 85 ms 75716 KB Output is correct
52 Correct 83 ms 75668 KB Output is correct
53 Correct 179 ms 45580 KB Output is correct
54 Correct 122 ms 75688 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 42892 KB Output is correct
2 Correct 32 ms 42948 KB Output is correct
3 Correct 39 ms 42948 KB Output is correct
4 Correct 28 ms 42880 KB Output is correct
5 Execution timed out 5057 ms 43116 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 42836 KB Output is correct
2 Correct 37 ms 42964 KB Output is correct
3 Correct 26 ms 42884 KB Output is correct
4 Correct 2604 ms 43220 KB Output is correct
5 Execution timed out 5046 ms 43608 KB Time limit exceeded
6 Halted 0 ms 0 KB -