Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

14921
62804
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~2 範例測資 0 / 0
2 0~22 存在一個節點 $v$,使得以節點 $v$ 為根時,輸入是一棵二元樹 29 / 29
3 0~42 無額外限制 71 / 71

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 2 3 0040.0 33560 26980 Accepted 100
1 1 2 3 0040.0 33560 26964 Accepted 100
2 1 2 3 0040.3 33560 27008 Accepted 100
3 2 3 0040.5 33560 26780 Accepted 100
4 2 3 0038.5 33560 26936 Accepted 100
5 2 3 0039.1 33560 27004 Accepted 100
6 2 3 0040.3 33560 26916 Accepted 100
7 2 3 0039.0 33560 26996 Accepted 100
8 2 3 0039.3 33560 27020 Accepted 100
9 2 3 0039.9 33560 26936 Accepted 100
10 2 3 0040.1 33560 27032 Accepted 100
11 2 3 0038.4 33560 26916 Accepted 100
12 2 3 0039.2 33560 26748 Accepted 100
13 2 3 0046.4 33824 27240 Accepted 100
14 2 3 0627.0 48180 43604 Accepted 100
15 2 3 0235.6 39664 34064 Accepted 100
16 2 3 0344.6 42368 37068 Accepted 100
17 2 3 0500.5 46048 41128 Accepted 100
18 2 3 0642.9 48620 44120 Accepted 100
19 2 3 0781.4 51232 46820 Accepted 100
20 2 3 0912.0 53884 49936 Accepted 100
21 2 3 1472.6 65088 62556 Accepted 100
22 2 3 1464.1 65200 62672 Accepted 100
23 3 0039.2 33560 26996 Accepted 100
24 3 0037.4 33560 26936 Accepted 100
25 3 0037.2 33560 26876 Accepted 100
26 3 0039.0 33560 26936 Accepted 100
27 3 0038.8 33560 27000 Accepted 100
28 3 0039.3 33560 26944 Accepted 100
29 3 0039.2 33560 27068 Accepted 100
30 3 0039.0 33560 26976 Accepted 100
31 3 0038.5 33560 26992 Accepted 100
32 3 0039.5 33560 27032 Accepted 100
33 3 0044.9 33824 27440 Accepted 100
34 3 0612.0 48244 43660 Accepted 100
35 3 0225.9 39780 33900 Accepted 100
36 3 0359.9 42456 37032 Accepted 100
37 3 0530.0 45968 41124 Accepted 100
38 3 0665.2 48656 44180 Accepted 100
39 3 0756.0 51320 47064 Accepted 100
40 3 0896.5 53972 50080 Accepted 100
41 3 1465.5 65260 62660 Accepted 100
42 3 1436.5 65256 62804 Accepted 100
Submitter:
Compiler:
c++20
Code Length:
1.24 KB
Back to Top