oj.uz

답안 #848993

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848993 2023-09-13T19:51:34 Z rainboy 참나무 (IOI23_beechtree) C++17
100 / 100
 475 ms 145360 KB 
#include "beechtree.h"
#include <cstdlib>
#include <cstring>

using namespace std;

typedef vector<int> vi;

const int N = 200000, LN = 18, N_ = N * (LN + 1) + 1;	/* LN = ceil(log2(N)) */

int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int n;
int pp[N], cc[N];
int *ej[N], eo[N];

void append(int i, int j) {
	int o = eo[i]++;
	if (o >= 2 && (o & o - 1) == 0)
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
	ej[i][o] = j;
}

int xx[N], ta[N], tb[N];

void dfs1(int i) {
	static int time;
	ta[i] = time++;
	xx[i] = 1;
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		dfs1(j);
		xx[i] += xx[j];
	}
	tb[i] = time;
}

int qq[N], yy[N], ii[N], jj[N], kk[N + 2];

void extend() {
	for (int i = n - 1; i >= 0; i--) {
		yy[i] = qq[i] == -1 ? 0 : xx[qq[i]];
		qq[i] = qq[i] == -1 ? -1 : qq[qq[i]];
	}
}

void sort(int *xx, int *ii, int *jj) {
	memset(kk, 0, (n + 2) * sizeof *kk);
	for (int i = 0; i < n; i++) {
		int j = ii[i];
		kk[xx[j] + 1]++;
	}
	for (int x = 1; x <= n + 1; x++)
		kk[x] += kk[x - 1];
	for (int i = 0; i < n; i++) {
		int j = ii[i];
		jj[kk[xx[j]]++] = j;
	}
}

void compress() {
	for (int i = 0, x = 0; i < n; i++)
		xx[ii[i]] = i + 1 == n || xx[ii[i + 1]] != xx[ii[i]] || yy[ii[i + 1]] != yy[ii[i]] ? x++ : x;
}

int ll[N_], rr[N_], kk_[N_];

int node(int l, int r, int x) {
	static int _ = 1;
	int t_ = _++;
	kk_[t_] = 1;
	if (r - l > 1) {
		int m = (l + r) / 2;
		if (x < m)
			ll[t_] = node(l, m, x);
		else
			rr[t_] = node(m, r, x);
	}
	return t_;
}

int merge(int t1, int t2) {
	if (t1 == 0)
		return t2;
	if (t2 == 0)
		return t1;
	ll[t1] = merge(ll[t1], ll[t2]), rr[t1] = merge(rr[t1], rr[t2]), kk_[t1] += kk_[t2];
	return t1;
}

int query(int t, int l, int r, int k) {
	if (r - l == 1)
		return l;
	int m = (l + r) / 2;
	return k <= kk_[ll[t]] ? query(ll[t], l, m, k) : query(rr[t], m, r, k - kk_[ll[t]]);
}

int ll_[N_], rr_[N_], mn[N_], mx[N_];

int node_(int l, int r, int x) {
	static int _ = 1;
	int t_ = _++;
	mn[t_] = mx[t_] = xx[pp[ii[x]]];
	if (r - l > 1) {
		int m = (l + r) / 2;
		if (x < m)
			ll_[t_] = node_(l, m, x);
		else
			rr_[t_] = node_(m, r, x);
	}
	return t_;
}

int x_, incr;

int merge_(int t1, int t2) {
	if (t1 == 0 && t2 == 0)
		return 0;
	if (t1 == 0) {
		if (x_ > mn[t2])
			incr = 0;
		x_ = mx[t2];
		return t2;
	}
	if (t2 == 0) {
		if (x_ > mn[t1])
			incr = 0;
		x_ = mx[t1];
		return t1;
	}
	ll_[t1] = merge_(ll_[t1], ll_[t2]), rr_[t1] = merge_(rr_[t1], rr_[t2]);
	mn[t1] = min(mn[t1], mn[t2]), mx[t1] = max(mx[t1], mx[t2]);
	return t1;
}

int tt[N], tt_[N]; char good[N];

void dfs2(int i) {
	good[i] = 1;
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		dfs2(j);
		if (!good[j])
			good[i] = 0;
	}
	if (!good[i])
		return;
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		if (jj[cc[j]] != -1) {
			good[i] = 0;
			goto cleanup;
		}
		jj[cc[j]] = j;
	}
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		tt_[j] = node_(0, n, xx[j]), yy[j] = xx[i], kk[j] = 1;
	}
	tt[i] = node(0, n, xx[i]);
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		tt[i] = merge(tt[i], tt[j]);
		for (int o = eo[j]; o--; ) {
			int k = ej[j][o], j_ = jj[cc[k]];
			if (j_ == -1) {
				good[i] = 0;
				goto cleanup;
			}
			x_ = -1, incr = 1, tt_[j_] = merge_(tt_[j_], tt_[k]);
			if (!incr) {
				good[i] = 0;
				goto cleanup;
			}
			yy[j_] = max(yy[j_], yy[k]), kk[j_] += kk[k];
		}
	}
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		if (yy[j] > query(tt[i], 0, n, kk[j])) {
			good[i] = 0;
			goto cleanup;
		}
	}
cleanup:
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		jj[cc[j]] = -1;
	}
}

vi beechtree(int n_, int m, vi pp_, vi cc_) {
	n = n_;
	for (int i = 0; i < n; i++)
		pp[i] = pp_[i], cc[i] = cc_[i] - 1;
	for (int i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (int i = 1; i < n; i++)
		append(pp[i], i);
	dfs1(0);
	for (int i = 0; i < n; i++) {
		xx[i] = n - xx[i];
		qq[i] = pp[i];
		ii[i] = i;
	}
	for (int l = 0; l <= LN; l++) {
		extend();
		sort(yy, ii, jj);
		sort(xx, jj, ii);
		compress();
	}
	for (int i = 0; i < n; i++)
		yy[i] = ta[i];
	sort(yy, ii, jj);
	sort(xx, jj, ii);
	compress();
	memset(jj, -1, m * sizeof *jj);
	dfs2(0);
	vi good_(n, 0);
	for (int i = 0; i < n; i++)
		good_[i] = good[i];
	return good_;
}

Compilation message

beechtree.cpp: In function 'void append(int, int)':
beechtree.cpp:26:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   26 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16884 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 3 ms 25012 KB Output is correct

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24924 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 3 ms 24924 KB Output is correct
4 Correct 3 ms 25048 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 25012 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 3 ms 24924 KB Output is correct
11 Correct 3 ms 25176 KB Output is correct
12 Correct 2 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 3 ms 25276 KB Output is correct
15 Correct 3 ms 24924 KB Output is correct
16 Correct 3 ms 25048 KB Output is correct
17 Correct 2 ms 24924 KB Output is correct
18 Correct 3 ms 24924 KB Output is correct
19 Correct 3 ms 24924 KB Output is correct
20 Correct 3 ms 24924 KB Output is correct
21 Correct 3 ms 24924 KB Output is correct
22 Correct 3 ms 25012 KB Output is correct
23 Correct 3 ms 24924 KB Output is correct
24 Correct 3 ms 24924 KB Output is correct
25 Correct 3 ms 24924 KB Output is correct
26 Correct 2 ms 24924 KB Output is correct
27 Correct 3 ms 24924 KB Output is correct
28 Correct 3 ms 24924 KB Output is correct
29 Correct 3 ms 24924 KB Output is correct
30 Correct 3 ms 24924 KB Output is correct
31 Correct 3 ms 24924 KB Output is correct
32 Correct 3 ms 24924 KB Output is correct
33 Correct 2 ms 25176 KB Output is correct
34 Correct 3 ms 25056 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24924 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 3 ms 24924 KB Output is correct
4 Correct 3 ms 25048 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 119 ms 54220 KB Output is correct
8 Correct 139 ms 54224 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 3 ms 24924 KB Output is correct
11 Correct 3 ms 24924 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 4 ms 25180 KB Output is correct
14 Correct 4 ms 25180 KB Output is correct
15 Correct 4 ms 25180 KB Output is correct
16 Correct 4 ms 25176 KB Output is correct
17 Correct 206 ms 145360 KB Output is correct
18 Correct 173 ms 124496 KB Output is correct
19 Correct 149 ms 72784 KB Output is correct
20 Correct 112 ms 54212 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24924 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 3 ms 24924 KB Output is correct
4 Correct 3 ms 24924 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 3 ms 24924 KB Output is correct
8 Correct 3 ms 24924 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 3 ms 24924 KB Output is correct
11 Correct 3 ms 24924 KB Output is correct
12 Correct 4 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 4 ms 24924 KB Output is correct
15 Correct 118 ms 82520 KB Output is correct
16 Correct 93 ms 78268 KB Output is correct
17 Correct 111 ms 78164 KB Output is correct
18 Correct 123 ms 82604 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24924 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 25012 KB Output is correct
5 Correct 119 ms 54220 KB Output is correct
6 Correct 139 ms 54224 KB Output is correct
7 Correct 3 ms 24924 KB Output is correct
8 Correct 3 ms 24924 KB Output is correct
9 Correct 4 ms 25180 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 209 ms 118848 KB Output is correct
12 Correct 163 ms 118020 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16884 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 3 ms 25012 KB Output is correct
4 Correct 3 ms 24924 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 3 ms 25048 KB Output is correct
8 Correct 3 ms 24924 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 2 ms 16732 KB Output is correct
11 Correct 3 ms 25012 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 3 ms 25176 KB Output is correct
15 Correct 2 ms 24924 KB Output is correct
16 Correct 3 ms 24924 KB Output is correct
17 Correct 3 ms 25276 KB Output is correct
18 Correct 3 ms 24924 KB Output is correct
19 Correct 3 ms 25048 KB Output is correct
20 Correct 2 ms 24924 KB Output is correct
21 Correct 3 ms 24924 KB Output is correct
22 Correct 3 ms 24924 KB Output is correct
23 Correct 3 ms 24924 KB Output is correct
24 Correct 3 ms 24924 KB Output is correct
25 Correct 3 ms 25012 KB Output is correct
26 Correct 3 ms 24924 KB Output is correct
27 Correct 3 ms 24924 KB Output is correct
28 Correct 3 ms 24924 KB Output is correct
29 Correct 2 ms 24924 KB Output is correct
30 Correct 3 ms 24924 KB Output is correct
31 Correct 3 ms 24924 KB Output is correct
32 Correct 3 ms 24924 KB Output is correct
33 Correct 3 ms 24924 KB Output is correct
34 Correct 3 ms 24924 KB Output is correct
35 Correct 3 ms 24924 KB Output is correct
36 Correct 2 ms 25176 KB Output is correct
37 Correct 3 ms 25056 KB Output is correct
38 Correct 3 ms 24924 KB Output is correct
39 Correct 3 ms 24924 KB Output is correct
40 Correct 3 ms 24924 KB Output is correct
41 Correct 3 ms 24924 KB Output is correct
42 Correct 3 ms 24924 KB Output is correct
43 Correct 3 ms 24924 KB Output is correct
44 Correct 3 ms 24924 KB Output is correct
45 Correct 3 ms 24924 KB Output is correct
46 Correct 3 ms 24924 KB Output is correct
47 Correct 3 ms 24924 KB Output is correct
48 Correct 3 ms 24924 KB Output is correct
49 Correct 3 ms 24924 KB Output is correct
50 Correct 3 ms 24924 KB Output is correct
51 Correct 3 ms 24924 KB Output is correct
52 Correct 3 ms 24924 KB Output is correct
53 Correct 3 ms 24924 KB Output is correct
54 Correct 3 ms 24920 KB Output is correct
55 Correct 3 ms 25040 KB Output is correct
56 Correct 3 ms 24924 KB Output is correct
57 Correct 3 ms 24924 KB Output is correct
58 Correct 3 ms 24924 KB Output is correct
59 Correct 3 ms 24924 KB Output is correct
60 Correct 3 ms 24924 KB Output is correct
61 Correct 3 ms 24924 KB Output is correct
62 Correct 3 ms 25120 KB Output is correct
63 Correct 3 ms 24924 KB Output is correct
64 Correct 3 ms 25024 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24924 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 25012 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 3 ms 25176 KB Output is correct
8 Correct 2 ms 24924 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 3 ms 25276 KB Output is correct
11 Correct 3 ms 24924 KB Output is correct
12 Correct 3 ms 25048 KB Output is correct
13 Correct 2 ms 24924 KB Output is correct
14 Correct 3 ms 24924 KB Output is correct
15 Correct 3 ms 24924 KB Output is correct
16 Correct 3 ms 24924 KB Output is correct
17 Correct 3 ms 24924 KB Output is correct
18 Correct 3 ms 25012 KB Output is correct
19 Correct 3 ms 24924 KB Output is correct
20 Correct 3 ms 24924 KB Output is correct
21 Correct 3 ms 24924 KB Output is correct
22 Correct 2 ms 24924 KB Output is correct
23 Correct 3 ms 24924 KB Output is correct
24 Correct 3 ms 24924 KB Output is correct
25 Correct 4 ms 25180 KB Output is correct
26 Correct 4 ms 25180 KB Output is correct
27 Correct 4 ms 25180 KB Output is correct
28 Correct 6 ms 25328 KB Output is correct
29 Correct 4 ms 25180 KB Output is correct
30 Correct 4 ms 25180 KB Output is correct
31 Correct 5 ms 25132 KB Output is correct
32 Correct 5 ms 25176 KB Output is correct
33 Correct 4 ms 24924 KB Output is correct
34 Correct 5 ms 24924 KB Output is correct
35 Correct 5 ms 24924 KB Output is correct
36 Correct 5 ms 24924 KB Output is correct
37 Correct 5 ms 25180 KB Output is correct
38 Correct 5 ms 25180 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16884 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 3 ms 25012 KB Output is correct
4 Correct 3 ms 24924 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 3 ms 25048 KB Output is correct
8 Correct 3 ms 24924 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 2 ms 16732 KB Output is correct
11 Correct 3 ms 25012 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 3 ms 25176 KB Output is correct
15 Correct 2 ms 24924 KB Output is correct
16 Correct 3 ms 24924 KB Output is correct
17 Correct 3 ms 25276 KB Output is correct
18 Correct 3 ms 24924 KB Output is correct
19 Correct 3 ms 25048 KB Output is correct
20 Correct 2 ms 24924 KB Output is correct
21 Correct 3 ms 24924 KB Output is correct
22 Correct 3 ms 24924 KB Output is correct
23 Correct 3 ms 24924 KB Output is correct
24 Correct 3 ms 24924 KB Output is correct
25 Correct 3 ms 25012 KB Output is correct
26 Correct 3 ms 24924 KB Output is correct
27 Correct 3 ms 24924 KB Output is correct
28 Correct 3 ms 24924 KB Output is correct
29 Correct 2 ms 24924 KB Output is correct
30 Correct 3 ms 24924 KB Output is correct
31 Correct 3 ms 24924 KB Output is correct
32 Correct 3 ms 24924 KB Output is correct
33 Correct 3 ms 24924 KB Output is correct
34 Correct 3 ms 24924 KB Output is correct
35 Correct 3 ms 24924 KB Output is correct
36 Correct 2 ms 25176 KB Output is correct
37 Correct 3 ms 25056 KB Output is correct
38 Correct 3 ms 24924 KB Output is correct
39 Correct 3 ms 24924 KB Output is correct
40 Correct 3 ms 24924 KB Output is correct
41 Correct 3 ms 24924 KB Output is correct
42 Correct 4 ms 25180 KB Output is correct
43 Correct 4 ms 25180 KB Output is correct
44 Correct 4 ms 25180 KB Output is correct
45 Correct 4 ms 25176 KB Output is correct
46 Correct 3 ms 24924 KB Output is correct
47 Correct 3 ms 24924 KB Output is correct
48 Correct 3 ms 24924 KB Output is correct
49 Correct 3 ms 24924 KB Output is correct
50 Correct 3 ms 24924 KB Output is correct
51 Correct 3 ms 24924 KB Output is correct
52 Correct 3 ms 24924 KB Output is correct
53 Correct 3 ms 24924 KB Output is correct
54 Correct 3 ms 24924 KB Output is correct
55 Correct 3 ms 24924 KB Output is correct
56 Correct 3 ms 24924 KB Output is correct
57 Correct 4 ms 24924 KB Output is correct
58 Correct 3 ms 24924 KB Output is correct
59 Correct 4 ms 24924 KB Output is correct
60 Correct 3 ms 24924 KB Output is correct
61 Correct 3 ms 24924 KB Output is correct
62 Correct 4 ms 25180 KB Output is correct
63 Correct 4 ms 24924 KB Output is correct
64 Correct 3 ms 24920 KB Output is correct
65 Correct 3 ms 25040 KB Output is correct
66 Correct 3 ms 24924 KB Output is correct
67 Correct 3 ms 24924 KB Output is correct
68 Correct 3 ms 24924 KB Output is correct
69 Correct 3 ms 24924 KB Output is correct
70 Correct 3 ms 24924 KB Output is correct
71 Correct 3 ms 24924 KB Output is correct
72 Correct 3 ms 25120 KB Output is correct
73 Correct 3 ms 24924 KB Output is correct
74 Correct 3 ms 25024 KB Output is correct
75 Correct 4 ms 25180 KB Output is correct
76 Correct 4 ms 25180 KB Output is correct
77 Correct 4 ms 25180 KB Output is correct
78 Correct 6 ms 25328 KB Output is correct
79 Correct 4 ms 25180 KB Output is correct
80 Correct 4 ms 25180 KB Output is correct
81 Correct 5 ms 25132 KB Output is correct
82 Correct 5 ms 25176 KB Output is correct
83 Correct 4 ms 24924 KB Output is correct
84 Correct 5 ms 24924 KB Output is correct
85 Correct 5 ms 24924 KB Output is correct
86 Correct 5 ms 24924 KB Output is correct
87 Correct 5 ms 25180 KB Output is correct
88 Correct 5 ms 25180 KB Output is correct
89 Correct 5 ms 25432 KB Output is correct
90 Correct 5 ms 25180 KB Output is correct
91 Correct 5 ms 24920 KB Output is correct
92 Correct 5 ms 24924 KB Output is correct
93 Correct 4 ms 24924 KB Output is correct
94 Correct 5 ms 25180 KB Output is correct
95 Correct 5 ms 25176 KB Output is correct
96 Correct 5 ms 24924 KB Output is correct
97 Correct 5 ms 25176 KB Output is correct
98 Correct 4 ms 25180 KB Output is correct

Subtask #8
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24924 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 25012 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 3 ms 25176 KB Output is correct
8 Correct 2 ms 24924 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 3 ms 25276 KB Output is correct
11 Correct 3 ms 24924 KB Output is correct
12 Correct 3 ms 25048 KB Output is correct
13 Correct 2 ms 24924 KB Output is correct
14 Correct 3 ms 24924 KB Output is correct
15 Correct 3 ms 24924 KB Output is correct
16 Correct 3 ms 24924 KB Output is correct
17 Correct 3 ms 24924 KB Output is correct
18 Correct 3 ms 25012 KB Output is correct
19 Correct 3 ms 24924 KB Output is correct
20 Correct 3 ms 24924 KB Output is correct
21 Correct 3 ms 24924 KB Output is correct
22 Correct 2 ms 24924 KB Output is correct
23 Correct 3 ms 24924 KB Output is correct
24 Correct 3 ms 24924 KB Output is correct
25 Correct 4 ms 25180 KB Output is correct
26 Correct 4 ms 25180 KB Output is correct
27 Correct 4 ms 25180 KB Output is correct
28 Correct 6 ms 25328 KB Output is correct
29 Correct 4 ms 25180 KB Output is correct
30 Correct 4 ms 25180 KB Output is correct
31 Correct 5 ms 25132 KB Output is correct
32 Correct 5 ms 25176 KB Output is correct
33 Correct 4 ms 24924 KB Output is correct
34 Correct 5 ms 24924 KB Output is correct
35 Correct 5 ms 24924 KB Output is correct
36 Correct 5 ms 24924 KB Output is correct
37 Correct 5 ms 25180 KB Output is correct
38 Correct 5 ms 25180 KB Output is correct
39 Correct 209 ms 145232 KB Output is correct
40 Correct 163 ms 116188 KB Output is correct
41 Correct 153 ms 101852 KB Output is correct
42 Correct 109 ms 54212 KB Output is correct
43 Correct 215 ms 138324 KB Output is correct
44 Correct 206 ms 128784 KB Output is correct
45 Correct 436 ms 126548 KB Output is correct
46 Correct 284 ms 126448 KB Output is correct
47 Correct 256 ms 126548 KB Output is correct
48 Correct 228 ms 126572 KB Output is correct
49 Correct 210 ms 122560 KB Output is correct
50 Correct 271 ms 126416 KB Output is correct
51 Correct 243 ms 126564 KB Output is correct
52 Correct 243 ms 126552 KB Output is correct
53 Correct 233 ms 126336 KB Output is correct
54 Correct 211 ms 121852 KB Output is correct
55 Correct 175 ms 120820 KB Output is correct
56 Correct 206 ms 125284 KB Output is correct
57 Correct 180 ms 114856 KB Output is correct
58 Correct 182 ms 114244 KB Output is correct
59 Correct 205 ms 114364 KB Output is correct
60 Correct 192 ms 114260 KB Output is correct
61 Correct 189 ms 114088 KB Output is correct
62 Correct 180 ms 114108 KB Output is correct
63 Correct 227 ms 131128 KB Output is correct
64 Correct 195 ms 114380 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16884 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 3 ms 25012 KB Output is correct
4 Correct 3 ms 24924 KB Output is correct
5 Correct 3 ms 24924 KB Output is correct
6 Correct 3 ms 24924 KB Output is correct
7 Correct 3 ms 25048 KB Output is correct
8 Correct 3 ms 24924 KB Output is correct
9 Correct 3 ms 24924 KB Output is correct
10 Correct 2 ms 16732 KB Output is correct
11 Correct 3 ms 25012 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 3 ms 25176 KB Output is correct
15 Correct 2 ms 24924 KB Output is correct
16 Correct 3 ms 24924 KB Output is correct
17 Correct 3 ms 25276 KB Output is correct
18 Correct 3 ms 24924 KB Output is correct
19 Correct 3 ms 25048 KB Output is correct
20 Correct 2 ms 24924 KB Output is correct
21 Correct 3 ms 24924 KB Output is correct
22 Correct 3 ms 24924 KB Output is correct
23 Correct 3 ms 24924 KB Output is correct
24 Correct 3 ms 24924 KB Output is correct
25 Correct 3 ms 25012 KB Output is correct
26 Correct 3 ms 24924 KB Output is correct
27 Correct 3 ms 24924 KB Output is correct
28 Correct 3 ms 24924 KB Output is correct
29 Correct 2 ms 24924 KB Output is correct
30 Correct 3 ms 24924 KB Output is correct
31 Correct 3 ms 24924 KB Output is correct
32 Correct 3 ms 24924 KB Output is correct
33 Correct 3 ms 24924 KB Output is correct
34 Correct 3 ms 24924 KB Output is correct
35 Correct 3 ms 24924 KB Output is correct
36 Correct 2 ms 25176 KB Output is correct
37 Correct 3 ms 25056 KB Output is correct
38 Correct 119 ms 54220 KB Output is correct
39 Correct 139 ms 54224 KB Output is correct
40 Correct 3 ms 24924 KB Output is correct
41 Correct 3 ms 24924 KB Output is correct
42 Correct 3 ms 24924 KB Output is correct
43 Correct 3 ms 24924 KB Output is correct
44 Correct 4 ms 25180 KB Output is correct
45 Correct 4 ms 25180 KB Output is correct
46 Correct 4 ms 25180 KB Output is correct
47 Correct 4 ms 25176 KB Output is correct
48 Correct 206 ms 145360 KB Output is correct
49 Correct 173 ms 124496 KB Output is correct
50 Correct 149 ms 72784 KB Output is correct
51 Correct 112 ms 54212 KB Output is correct
52 Correct 3 ms 24924 KB Output is correct
53 Correct 3 ms 24924 KB Output is correct
54 Correct 3 ms 24924 KB Output is correct
55 Correct 3 ms 24924 KB Output is correct
56 Correct 3 ms 24924 KB Output is correct
57 Correct 3 ms 24924 KB Output is correct
58 Correct 3 ms 24924 KB Output is correct
59 Correct 3 ms 24924 KB Output is correct
60 Correct 3 ms 24924 KB Output is correct
61 Correct 3 ms 24924 KB Output is correct
62 Correct 3 ms 24924 KB Output is correct
63 Correct 4 ms 24924 KB Output is correct
64 Correct 3 ms 24924 KB Output is correct
65 Correct 4 ms 24924 KB Output is correct
66 Correct 118 ms 82520 KB Output is correct
67 Correct 93 ms 78268 KB Output is correct
68 Correct 111 ms 78164 KB Output is correct
69 Correct 123 ms 82604 KB Output is correct
70 Correct 3 ms 24924 KB Output is correct
71 Correct 3 ms 24924 KB Output is correct
72 Correct 4 ms 25180 KB Output is correct
73 Correct 4 ms 24924 KB Output is correct
74 Correct 209 ms 118848 KB Output is correct
75 Correct 163 ms 118020 KB Output is correct
76 Correct 3 ms 24920 KB Output is correct
77 Correct 3 ms 25040 KB Output is correct
78 Correct 3 ms 24924 KB Output is correct
79 Correct 3 ms 24924 KB Output is correct
80 Correct 3 ms 24924 KB Output is correct
81 Correct 3 ms 24924 KB Output is correct
82 Correct 3 ms 24924 KB Output is correct
83 Correct 3 ms 24924 KB Output is correct
84 Correct 3 ms 25120 KB Output is correct
85 Correct 3 ms 24924 KB Output is correct
86 Correct 3 ms 25024 KB Output is correct
87 Correct 4 ms 25180 KB Output is correct
88 Correct 4 ms 25180 KB Output is correct
89 Correct 4 ms 25180 KB Output is correct
90 Correct 6 ms 25328 KB Output is correct
91 Correct 4 ms 25180 KB Output is correct
92 Correct 4 ms 25180 KB Output is correct
93 Correct 5 ms 25132 KB Output is correct
94 Correct 5 ms 25176 KB Output is correct
95 Correct 4 ms 24924 KB Output is correct
96 Correct 5 ms 24924 KB Output is correct
97 Correct 5 ms 24924 KB Output is correct
98 Correct 5 ms 24924 KB Output is correct
99 Correct 5 ms 25180 KB Output is correct
100 Correct 5 ms 25180 KB Output is correct
101 Correct 5 ms 25432 KB Output is correct
102 Correct 5 ms 25180 KB Output is correct
103 Correct 5 ms 24920 KB Output is correct
104 Correct 5 ms 24924 KB Output is correct
105 Correct 4 ms 24924 KB Output is correct
106 Correct 5 ms 25180 KB Output is correct
107 Correct 5 ms 25176 KB Output is correct
108 Correct 5 ms 24924 KB Output is correct
109 Correct 5 ms 25176 KB Output is correct
110 Correct 4 ms 25180 KB Output is correct
111 Correct 209 ms 145232 KB Output is correct
112 Correct 163 ms 116188 KB Output is correct
113 Correct 153 ms 101852 KB Output is correct
114 Correct 109 ms 54212 KB Output is correct
115 Correct 215 ms 138324 KB Output is correct
116 Correct 206 ms 128784 KB Output is correct
117 Correct 436 ms 126548 KB Output is correct
118 Correct 284 ms 126448 KB Output is correct
119 Correct 256 ms 126548 KB Output is correct
120 Correct 228 ms 126572 KB Output is correct
121 Correct 210 ms 122560 KB Output is correct
122 Correct 271 ms 126416 KB Output is correct
123 Correct 243 ms 126564 KB Output is correct
124 Correct 243 ms 126552 KB Output is correct
125 Correct 233 ms 126336 KB Output is correct
126 Correct 211 ms 121852 KB Output is correct
127 Correct 175 ms 120820 KB Output is correct
128 Correct 206 ms 125284 KB Output is correct
129 Correct 180 ms 114856 KB Output is correct
130 Correct 182 ms 114244 KB Output is correct
131 Correct 205 ms 114364 KB Output is correct
132 Correct 192 ms 114260 KB Output is correct
133 Correct 189 ms 114088 KB Output is correct
134 Correct 180 ms 114108 KB Output is correct
135 Correct 227 ms 131128 KB Output is correct
136 Correct 195 ms 114380 KB Output is correct
137 Correct 236 ms 134736 KB Output is correct
138 Correct 199 ms 125128 KB Output is correct
139 Correct 475 ms 126676 KB Output is correct
140 Correct 307 ms 126672 KB Output is correct
141 Correct 260 ms 126664 KB Output is correct
142 Correct 232 ms 126632 KB Output is correct
143 Correct 230 ms 118676 KB Output is correct
144 Correct 266 ms 127312 KB Output is correct
145 Correct 234 ms 126544 KB Output is correct
146 Correct 244 ms 126784 KB Output is correct
147 Correct 239 ms 126324 KB Output is correct
148 Correct 208 ms 119592 KB Output is correct
149 Correct 180 ms 118612 KB Output is correct
150 Correct 175 ms 120744 KB Output is correct
151 Correct 184 ms 115140 KB Output is correct
152 Correct 192 ms 114260 KB Output is correct
153 Correct 191 ms 114272 KB Output is correct
154 Correct 187 ms 114260 KB Output is correct
155 Correct 187 ms 114100 KB Output is correct
156 Correct 190 ms 114356 KB Output is correct
157 Correct 225 ms 131100 KB Output is correct
158 Correct 196 ms 114260 KB Output is correct