oj.uz

Submission #1068292

# Submission time Handle Problem Language Result Execution time Memory
1068292 2024-08-21T09:07:34 Z AmirAli_H1 Beech Tree (IOI23_beechtree) C++17
49 / 100
 177 ms 18052 KB 
// In the name of Allah

#include <bits/stdc++.h>
#include "beechtree.h"
using namespace std;

typedef			long long				ll;
typedef			pair<int, int>			pii;
typedef			pair<ll, ll>			pll;

#define			F						first
#define			S						second
#define			endl					'\n'
#define			sep						' '
#define			pb						push_back
#define			Mp						make_pair
#define			all(x)					(x).begin(),(x).end()
#define			len(x)					((ll) (x).size())

const int maxn = 2000 + 4;
const int maxlg = 12;

int n, m;
int par[maxn], col[maxn];
vector<pii> adj[maxn];
int h[maxn], arr[maxn];
vector<int> ls1, ls2;
int val[maxn][maxn];
int M[maxn]; vector<int> ans;
int st[maxn], ft[maxn], timer;
int up[maxn][maxlg];

bool cmp(int i, int j) {
	return (h[i] < h[j]);
}

bool is_gr(int v, int u) {
	return (st[v] <= st[u] && ft[v] >= ft[u]);
}

int lca(int u, int v) {
	if (is_gr(u, v)) return u;
	if (is_gr(v, u)) return v;
	for (int i = maxlg - 1; i >= 0; i--) {
		if (!is_gr(up[v][i], u)) v = up[v][i];
	}
	return up[v][0];
}

void pre_dfs(int v) {
	up[v][0] = (par[v] != -1) ? par[v] : v;
	for (int i = 1; i < maxlg; i++) up[v][i] = up[up[v][i - 1]][i - 1];
	
	st[v] = timer++;
	for (auto f : adj[v]) {
		int u = f.S;
		h[u] = h[v] + 1;
		pre_dfs(u);
	}
	ft[v] = timer;
}

void dfs(int v) {
	for (auto f : adj[v]) {
		int u = f.S;
		dfs(u);
		M[v] += M[u];
	}
}

void setx(int v, vector<int> & ls) {
	for (auto f : adj[v]) {
		int c = f.F, u = f.S;
		if (ls[c] == -1) ls[c] = u;
		else ls[c] = -2;
	}
}

void setd(int v, vector<int> & ls) {
	for (auto f : adj[v]) {
		int c = f.F, u = f.S;
		ls[c] = -1;
	}
}

bool ok(int u, int v) {
	for (auto f : adj[u]) {
		int c = f.F;
		if (ls1[c] == -2) return 0;
	}
	for (auto f : adj[v]) {
		int c = f.F;
		if (ls2[c] == -2) return 0;
	}
	
	int T = 0; bool flag = 1;
	for (auto f : adj[u]) {
		int c = f.F;
		if (ls2[c] == -1) {
			flag = 0;
			break;
		}
	}
	T += flag;
	
	flag = 1;
	for (auto f : adj[v]) {
		int c = f.F;
		if (ls1[c] == -1) {
			flag = 0;
			break;
		}
	}
	T += flag;
	
	return (T >= 1);
}

vector<int> beechtree(int Nx, int Mx, vector<int> Px, vector<int> Cx) {
	n = Nx; m = Mx;
	for (int i = 0; i < n; i++) Cx[i]--;
	for (int i = 0; i < n; i++) {
		par[i] = Px[i]; col[i] = Cx[i];
	}
	for (int i = 1; i < n; i++) {
		adj[par[i]].pb(Mp(col[i], i));
	}
	for (int i = 0; i < n; i++) sort(all(adj[i]));
	
	pre_dfs(0);
	iota(arr, arr + n, 0);
	sort(arr, arr + n, cmp); reverse(arr, arr + n);
	
	ls1.resize(m); ls2.resize(m);
	fill(all(ls1), -1); fill(all(ls2), -1);
	for (int i1 = 0; i1 < n; i1++) {
		for (int i2 = i1 + 1; i2 < n; i2++) {
			int u = arr[i1], v = arr[i2];
			setx(u, ls1); setx(v, ls2);
			if (!ok(u, v)) {
				val[u][v] = val[v][u] = -23;
			}
			else {
				if (len(adj[u]) > len(adj[v])) {
					val[u][v] = 1; val[v][u] = -1;
				}
				else if (len(adj[v]) > len(adj[u])) {
					val[u][v] = -1; val[v][u] = 1;
				}
				else {
					val[u][v] = val[v][u] = 0;
				}
				for (auto f : adj[u]) {
					int c = f.F;
					int ux = ls1[c], vx = ls2[c];
					if (vx == -1) continue;
					if (val[ux][vx] == -23 || val[u][v] == -23) {
						val[u][v] = val[v][u] = -23;
					}
					else if (val[ux][vx] == 1) {
						if (val[u][v] == -1) val[u][v] = val[v][u] = -23;
						else {
							val[u][v] = 1; val[v][u] = -1;
						}
					}
					else if (val[ux][vx] == -1) {
						if (val[u][v] == 1) val[u][v] = val[v][u] = -23;
						else {
							val[u][v] = -1; val[v][u] = 1;
						}
					}
				}
			}
			if (val[u][v] == -23) {
				int r = lca(u, v);
				M[r]++;
			}
			setd(u, ls1); setd(v, ls2);
		}
	}
	
	dfs(0);
	ans.resize(n);
	for (int i = 0; i < n; i++) {
		if (M[i] == 0) ans[i] = 1;
		else ans[i] = 0;
	}
	return ans;
}

Compilation message

beechtree.cpp: In function 'void setd(int, std::vector<int>&)':
beechtree.cpp:81:16: warning: unused variable 'u' [-Wunused-variable]
   81 |   int c = f.F, u = f.S;
      |                ^

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Runtime error 35 ms 6996 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 12 ms 11356 KB Output is correct
12 Correct 9 ms 9556 KB Output is correct
13 Correct 11 ms 10540 KB Output is correct
14 Correct 11 ms 10372 KB Output is correct
15 Runtime error 18 ms 4956 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Runtime error 35 ms 6996 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 1 ms 1116 KB Output is correct
43 Correct 1 ms 856 KB Output is correct
44 Correct 1 ms 860 KB Output is correct
45 Correct 1 ms 860 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 1 ms 860 KB Output is correct
48 Correct 1 ms 1368 KB Output is correct
49 Correct 1 ms 1372 KB Output is correct
50 Correct 1 ms 1468 KB Output is correct
51 Correct 1 ms 1372 KB Output is correct
52 Correct 2 ms 1372 KB Output is correct
53 Correct 1 ms 1372 KB Output is correct
54 Correct 1 ms 1372 KB Output is correct
55 Correct 1 ms 1372 KB Output is correct
56 Correct 1 ms 1372 KB Output is correct
57 Correct 1 ms 1372 KB Output is correct
58 Correct 1 ms 1368 KB Output is correct
59 Correct 1 ms 1368 KB Output is correct
60 Correct 2 ms 1372 KB Output is correct
61 Correct 1 ms 1372 KB Output is correct
62 Correct 1 ms 1372 KB Output is correct
63 Correct 1 ms 1372 KB Output is correct
64 Correct 2 ms 1372 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 43 ms 16476 KB Output is correct
26 Correct 41 ms 16476 KB Output is correct
27 Correct 42 ms 16464 KB Output is correct
28 Correct 53 ms 16464 KB Output is correct
29 Correct 66 ms 16468 KB Output is correct
30 Correct 114 ms 16364 KB Output is correct
31 Correct 60 ms 16372 KB Output is correct
32 Correct 92 ms 16220 KB Output is correct
33 Correct 76 ms 15956 KB Output is correct
34 Correct 65 ms 16364 KB Output is correct
35 Correct 67 ms 16296 KB Output is correct
36 Correct 55 ms 15740 KB Output is correct
37 Correct 55 ms 16372 KB Output is correct
38 Correct 121 ms 16304 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 1368 KB Output is correct
39 Correct 1 ms 1372 KB Output is correct
40 Correct 1 ms 1468 KB Output is correct
41 Correct 1 ms 1372 KB Output is correct
42 Correct 1 ms 856 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 1 ms 1116 KB Output is correct
45 Correct 1 ms 1116 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Correct 1 ms 856 KB Output is correct
48 Correct 1 ms 860 KB Output is correct
49 Correct 1 ms 860 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 860 KB Output is correct
52 Correct 12 ms 11356 KB Output is correct
53 Correct 9 ms 9556 KB Output is correct
54 Correct 11 ms 10540 KB Output is correct
55 Correct 11 ms 10372 KB Output is correct
56 Correct 2 ms 1372 KB Output is correct
57 Correct 1 ms 1372 KB Output is correct
58 Correct 1 ms 1372 KB Output is correct
59 Correct 1 ms 1372 KB Output is correct
60 Correct 1 ms 1372 KB Output is correct
61 Correct 1 ms 1372 KB Output is correct
62 Correct 1 ms 1368 KB Output is correct
63 Correct 1 ms 1368 KB Output is correct
64 Correct 2 ms 1372 KB Output is correct
65 Correct 1 ms 1372 KB Output is correct
66 Correct 1 ms 1372 KB Output is correct
67 Correct 1 ms 1372 KB Output is correct
68 Correct 2 ms 1372 KB Output is correct
69 Correct 43 ms 16476 KB Output is correct
70 Correct 41 ms 16476 KB Output is correct
71 Correct 42 ms 16464 KB Output is correct
72 Correct 53 ms 16464 KB Output is correct
73 Correct 66 ms 16468 KB Output is correct
74 Correct 114 ms 16364 KB Output is correct
75 Correct 60 ms 16372 KB Output is correct
76 Correct 92 ms 16220 KB Output is correct
77 Correct 76 ms 15956 KB Output is correct
78 Correct 65 ms 16364 KB Output is correct
79 Correct 67 ms 16296 KB Output is correct
80 Correct 55 ms 15740 KB Output is correct
81 Correct 55 ms 16372 KB Output is correct
82 Correct 121 ms 16304 KB Output is correct
83 Correct 40 ms 17936 KB Output is correct
84 Correct 41 ms 17992 KB Output is correct
85 Correct 60 ms 18052 KB Output is correct
86 Correct 50 ms 17952 KB Output is correct
87 Correct 62 ms 17644 KB Output is correct
88 Correct 32 ms 16468 KB Output is correct
89 Correct 57 ms 17952 KB Output is correct
90 Correct 177 ms 17968 KB Output is correct
91 Correct 56 ms 17988 KB Output is correct
92 Correct 100 ms 17956 KB Output is correct
93 Correct 114 ms 17488 KB Output is correct
94 Correct 63 ms 17756 KB Output is correct
95 Correct 62 ms 17900 KB Output is correct
96 Correct 71 ms 17244 KB Output is correct
97 Correct 57 ms 17968 KB Output is correct
98 Correct 150 ms 17896 KB Output is correct

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 43 ms 16476 KB Output is correct
26 Correct 41 ms 16476 KB Output is correct
27 Correct 42 ms 16464 KB Output is correct
28 Correct 53 ms 16464 KB Output is correct
29 Correct 66 ms 16468 KB Output is correct
30 Correct 114 ms 16364 KB Output is correct
31 Correct 60 ms 16372 KB Output is correct
32 Correct 92 ms 16220 KB Output is correct
33 Correct 76 ms 15956 KB Output is correct
34 Correct 65 ms 16364 KB Output is correct
35 Correct 67 ms 16296 KB Output is correct
36 Correct 55 ms 15740 KB Output is correct
37 Correct 55 ms 16372 KB Output is correct
38 Correct 121 ms 16304 KB Output is correct
39 Runtime error 28 ms 6940 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Runtime error 35 ms 6996 KB Execution killed with signal 11
39 Halted 0 ms 0 KB -