oj.uz

Submission #1068600

# Submission time Handle Problem Language Result Execution time Memory
1068600 2024-08-21T10:53:53 Z AmirAli_H1 Beech Tree (IOI23_beechtree) C++17
54 / 100
 143 ms 45908 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 = 2e5 + 4;
const int maxs = 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[maxs][maxs];
int M[maxn]; vector<int> ans;
int st[maxn], ft[maxn], timer;
int up[maxn][maxlg], cnt[maxn];

bool cmp1(int i, int j) {
	return (h[i] > h[j]);
}

bool cmp2(int i, int j) {
	return (Mp(len(adj[i]), h[i]) > Mp(len(adj[j]), 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);
}

void solve1() {
	iota(arr, arr + n, 0); sort(arr, arr + n, cmp1);
	
	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);
		}
	}
}

bool okx() {
	int v = arr[0];
	fill(cnt, cnt + m, 0);
	if (par[v] != -1) return 0;
	for (int i = 1; i < n; i++) {
		int v = arr[i];
		int j = cnt[col[v]]; cnt[col[v]]++;
		if (par[v] != arr[j]) return 0;
	}
	return 1;
}

void solvex() {
	for (int v = 0; v < n; v++) {
		setx(v, ls1);
		for (auto f : adj[v]) {
			int c = f.F;
			if (ls1[c] == -2) M[v]++;
		}
		for (auto f : adj[v]) {
			int u = f.S;
			for (auto g : adj[u]) {
				int c = g.F;
				if (ls1[c] == -1) M[v]++;
			}
		}
		setd(v, ls1);
	}
	if (*max_element(h, h + n) <= 2) {
		iota(arr, arr + n, 0); sort(arr, arr + n, cmp2);
		if (!okx()) M[0]++;
	}
}

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);
	
	ls1.resize(m); ls2.resize(m);
	fill(all(ls1), -1); fill(all(ls2), -1);
	
	if (n <= 2000) solve1();
	else solvex();
	
	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:86:16: warning: unused variable 'u' [-Wunused-variable]
   86 |   int c = f.F, u = f.S;
      |                ^

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 63 ms 45868 KB Output is correct
8 Correct 64 ms 45808 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 3 ms 14680 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 34 ms 28908 KB Output is correct
14 Correct 32 ms 28760 KB Output is correct
15 Correct 30 ms 28760 KB Output is correct
16 Correct 33 ms 28760 KB Output is correct
17 Correct 60 ms 43864 KB Output is correct
18 Correct 65 ms 43856 KB Output is correct
19 Correct 63 ms 43860 KB Output is correct
20 Correct 74 ms 45908 KB Output is correct

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14788 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 11 ms 24412 KB Output is correct
12 Correct 8 ms 22452 KB Output is correct
13 Correct 10 ms 24640 KB Output is correct
14 Correct 9 ms 24412 KB Output is correct
15 Correct 33 ms 22612 KB Output is correct
16 Correct 34 ms 23616 KB Output is correct
17 Correct 32 ms 23492 KB Output is correct
18 Incorrect 35 ms 23644 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
19 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 63 ms 45868 KB Output is correct
6 Correct 64 ms 45808 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 4 ms 14684 KB Output is correct
9 Correct 61 ms 28764 KB Output is correct
10 Correct 29 ms 28764 KB Output is correct
11 Incorrect 68 ms 33620 KB 2nd lines differ - on the 68th token, expected: '0', found: '1'
12 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14788 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 2 ms 14780 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 32 ms 27228 KB Output is correct
26 Correct 32 ms 27224 KB Output is correct
27 Correct 33 ms 27228 KB Output is correct
28 Correct 41 ms 27316 KB Output is correct
29 Correct 35 ms 27224 KB Output is correct
30 Correct 102 ms 27232 KB Output is correct
31 Correct 52 ms 27204 KB Output is correct
32 Correct 69 ms 26972 KB Output is correct
33 Correct 82 ms 27208 KB Output is correct
34 Correct 57 ms 27180 KB Output is correct
35 Correct 43 ms 27188 KB Output is correct
36 Correct 59 ms 26972 KB Output is correct
37 Correct 53 ms 27216 KB Output is correct
38 Correct 117 ms 27224 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14788 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14780 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 2 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 2 ms 14684 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 2 ms 14680 KB Output is correct
31 Correct 2 ms 14684 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 2 ms 14684 KB Output is correct
34 Correct 2 ms 14684 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14684 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 3 ms 14680 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14684 KB Output is correct
42 Correct 34 ms 28908 KB Output is correct
43 Correct 32 ms 28760 KB Output is correct
44 Correct 30 ms 28760 KB Output is correct
45 Correct 33 ms 28760 KB Output is correct
46 Correct 3 ms 14684 KB Output is correct
47 Correct 2 ms 14684 KB Output is correct
48 Correct 2 ms 14684 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 2 ms 14684 KB Output is correct
51 Correct 2 ms 14684 KB Output is correct
52 Correct 2 ms 14788 KB Output is correct
53 Correct 2 ms 14680 KB Output is correct
54 Correct 2 ms 14684 KB Output is correct
55 Correct 2 ms 14684 KB Output is correct
56 Correct 11 ms 24412 KB Output is correct
57 Correct 8 ms 22452 KB Output is correct
58 Correct 10 ms 24640 KB Output is correct
59 Correct 9 ms 24412 KB Output is correct
60 Correct 3 ms 14684 KB Output is correct
61 Correct 4 ms 14684 KB Output is correct
62 Correct 61 ms 28764 KB Output is correct
63 Correct 29 ms 28764 KB Output is correct
64 Correct 2 ms 14684 KB Output is correct
65 Correct 2 ms 14684 KB Output is correct
66 Correct 3 ms 14684 KB Output is correct
67 Correct 2 ms 14684 KB Output is correct
68 Correct 3 ms 14684 KB Output is correct
69 Correct 3 ms 14684 KB Output is correct
70 Correct 2 ms 14684 KB Output is correct
71 Correct 3 ms 14684 KB Output is correct
72 Correct 3 ms 14684 KB Output is correct
73 Correct 2 ms 14680 KB Output is correct
74 Correct 4 ms 14684 KB Output is correct
75 Correct 32 ms 27228 KB Output is correct
76 Correct 32 ms 27224 KB Output is correct
77 Correct 33 ms 27228 KB Output is correct
78 Correct 41 ms 27316 KB Output is correct
79 Correct 35 ms 27224 KB Output is correct
80 Correct 102 ms 27232 KB Output is correct
81 Correct 52 ms 27204 KB Output is correct
82 Correct 69 ms 26972 KB Output is correct
83 Correct 82 ms 27208 KB Output is correct
84 Correct 57 ms 27180 KB Output is correct
85 Correct 43 ms 27188 KB Output is correct
86 Correct 59 ms 26972 KB Output is correct
87 Correct 53 ms 27216 KB Output is correct
88 Correct 117 ms 27224 KB Output is correct
89 Correct 56 ms 28852 KB Output is correct
90 Correct 143 ms 28800 KB Output is correct
91 Correct 45 ms 28796 KB Output is correct
92 Correct 101 ms 28760 KB Output is correct
93 Correct 88 ms 28764 KB Output is correct
94 Correct 32 ms 28780 KB Output is correct
95 Correct 34 ms 28764 KB Output is correct
96 Correct 69 ms 28780 KB Output is correct
97 Correct 35 ms 28760 KB Output is correct
98 Correct 129 ms 28764 KB Output is correct

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14788 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 2 ms 14780 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 32 ms 27228 KB Output is correct
26 Correct 32 ms 27224 KB Output is correct
27 Correct 33 ms 27228 KB Output is correct
28 Correct 41 ms 27316 KB Output is correct
29 Correct 35 ms 27224 KB Output is correct
30 Correct 102 ms 27232 KB Output is correct
31 Correct 52 ms 27204 KB Output is correct
32 Correct 69 ms 26972 KB Output is correct
33 Correct 82 ms 27208 KB Output is correct
34 Correct 57 ms 27180 KB Output is correct
35 Correct 43 ms 27188 KB Output is correct
36 Correct 59 ms 26972 KB Output is correct
37 Correct 53 ms 27216 KB Output is correct
38 Correct 117 ms 27224 KB Output is correct
39 Correct 74 ms 42324 KB Output is correct
40 Correct 61 ms 42236 KB Output is correct
41 Correct 86 ms 42204 KB Output is correct
42 Correct 71 ms 44372 KB Output is correct
43 Correct 106 ms 38736 KB Output is correct
44 Correct 54 ms 33884 KB Output is correct
45 Correct 60 ms 30704 KB Output is correct
46 Incorrect 62 ms 30728 KB 2nd lines differ - on the 40007th token, expected: '0', found: '1'
47 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14788 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14780 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 2 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 2 ms 14684 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 2 ms 14680 KB Output is correct
31 Correct 2 ms 14684 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 2 ms 14684 KB Output is correct
34 Correct 2 ms 14684 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14684 KB Output is correct
38 Correct 63 ms 45868 KB Output is correct
39 Correct 64 ms 45808 KB Output is correct
40 Correct 2 ms 14680 KB Output is correct
41 Correct 3 ms 14680 KB Output is correct
42 Correct 2 ms 14684 KB Output is correct
43 Correct 2 ms 14684 KB Output is correct
44 Correct 34 ms 28908 KB Output is correct
45 Correct 32 ms 28760 KB Output is correct
46 Correct 30 ms 28760 KB Output is correct
47 Correct 33 ms 28760 KB Output is correct
48 Correct 60 ms 43864 KB Output is correct
49 Correct 65 ms 43856 KB Output is correct
50 Correct 63 ms 43860 KB Output is correct
51 Correct 74 ms 45908 KB Output is correct
52 Correct 3 ms 14684 KB Output is correct
53 Correct 2 ms 14684 KB Output is correct
54 Correct 2 ms 14684 KB Output is correct
55 Correct 2 ms 14684 KB Output is correct
56 Correct 2 ms 14684 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 2 ms 14788 KB Output is correct
59 Correct 2 ms 14680 KB Output is correct
60 Correct 2 ms 14684 KB Output is correct
61 Correct 2 ms 14684 KB Output is correct
62 Correct 11 ms 24412 KB Output is correct
63 Correct 8 ms 22452 KB Output is correct
64 Correct 10 ms 24640 KB Output is correct
65 Correct 9 ms 24412 KB Output is correct
66 Correct 33 ms 22612 KB Output is correct
67 Correct 34 ms 23616 KB Output is correct
68 Correct 32 ms 23492 KB Output is correct
69 Incorrect 35 ms 23644 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
70 Halted 0 ms 0 KB -