Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

12346
71352
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 0032.1 29652 27080 Accepted 100
1 1 2 3 0032.8 29652 26924 Accepted 100
2 1 2 3 0033.7 29652 27020 Accepted 100
3 2 3 0030.8 29652 27012 Accepted 100
4 2 3 0031.8 29652 27084 Accepted 100
5 2 3 0033.1 29652 26944 Accepted 100
6 2 3 0032.3 29652 27016 Accepted 100
7 2 3 0033.2 29652 26984 Accepted 100
8 2 3 0033.7 29652 27040 Accepted 100
9 2 3 0032.7 29652 27008 Accepted 100
10 2 3 0033.2 29652 26920 Accepted 100
11 2 3 0032.3 29652 27000 Accepted 100
12 2 3 0033.9 29652 27004 Accepted 100
13 2 3 0038.3 30048 27280 Accepted 100
14 2 3 0517.4 50388 47560 Accepted 100
15 2 3 0216.7 38320 35320 Accepted 100
16 2 3 0310.0 42064 38984 Accepted 100
17 2 3 0440.9 47312 44292 Accepted 100
18 2 3 0530.1 51060 48096 Accepted 100
19 2 3 0648.3 54716 51640 Accepted 100
20 2 3 0753.4 58420 55488 Accepted 100
21 2 3 1175.3 74220 71332 Accepted 100
22 2 3 1178.5 74316 71352 Accepted 100
23 3 0033.3 29652 27000 Accepted 100
24 3 0032.3 29652 26980 Accepted 100
25 3 0032.9 29652 26888 Accepted 100
26 3 0032.9 29652 26924 Accepted 100
27 3 0032.2 29652 26956 Accepted 100
28 3 0032.7 29652 27028 Accepted 100
29 3 0032.3 29652 26972 Accepted 100
30 3 0034.0 29652 26980 Accepted 100
31 3 0033.3 29652 27140 Accepted 100
32 3 0032.6 29652 27056 Accepted 100
33 3 0037.3 30048 27424 Accepted 100
34 3 0501.7 50204 47308 Accepted 100
35 3 0196.3 38312 35428 Accepted 100
36 3 0305.0 42032 39124 Accepted 100
37 3 0427.6 47132 43984 Accepted 100
38 3 0556.5 50852 47688 Accepted 100
39 3 0642.5 54544 51412 Accepted 100
40 3 0767.2 58248 55384 Accepted 100
41 3 1179.0 74012 71044 Accepted 100
42 3 1169.8 74008 71024 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
1.31 KB
Back to Top