NTUCPC Challenge! #1 題解公開! 連結
YTP 2025 題目已上線! 連結
程式解題社網站 程式解題社網站上線了!
Rejudge 公告 23 已加強測資並 rejudge
Back to Submissions List
Problem
Total Time (ms)
Score
126044
31104
Time Limit Exceeded
0
Subtask Results
Subtask no. |
Testdata Range |
Constraints |
Score |
1 |
0~2 |
範例測資 |
0 / 0
|
2 |
0~12 |
$1 \leq N, K \leq 200$ |
0 / 4
|
3 |
13~18 |
給定的樹是一條鍊 |
0 / 4
|
4 |
0~27 |
無額外限制 |
0 / 12
|
Testdata Results
Testdata no. |
Subtasks |
Time (ms) |
Memory (VSS, KiB) |
Memory (RSS, KiB) |
Verdict |
Score |
|
0 |
1
2
4
|
0005.9 |
8312 |
Wrong Answer |
0 |
|
|
1 |
1
2
4
|
0015.2 |
8312 |
Wrong Answer |
0 |
|
|
2 |
1
2
4
|
0007.1 |
8312 |
Wrong Answer |
0 |
|
|
3 |
2
4
|
3326.8 |
8444 |
Wrong Answer |
0 |
|
|
4 |
2
4
|
3425.6 |
8444 |
Wrong Answer |
0 |
|
|
5 |
2
4
|
3903.6 |
8444 |
Wrong Answer |
0 |
|
|
6 |
2
4
|
3465.7 |
8444 |
Wrong Answer |
0 |
|
|
7 |
2
4
|
3271.3 |
8444 |
Wrong Answer |
0 |
|
|
8 |
2
4
|
3703.9 |
8444 |
Wrong Answer |
0 |
|
|
9 |
2
4
|
3268.0 |
8444 |
Wrong Answer |
0 |
|
|
10 |
2
4
|
3335.1 |
8444 |
Wrong Answer |
0 |
|
|
11 |
2
4
|
3594.8 |
25868 |
Wrong Answer |
0 |
|
|
12 |
2
4
|
3747.9 |
29696 |
Wrong Answer |
0 |
|
|
13 |
3
4
|
6055.9 |
34892 |
Time Limit Exceeded |
0 |
|
|
14 |
3
4
|
6071.3 |
34892 |
Time Limit Exceeded |
0 |
|
|
15 |
3
4
|
6090.4 |
34628 |
Time Limit Exceeded |
0 |
|
|
16 |
3
4
|
6068.0 |
34628 |
Time Limit Exceeded |
0 |
|
|
17 |
3
4
|
6089.2 |
33440 |
Time Limit Exceeded |
0 |
|
|
18 |
3
4
|
6056.4 |
33572 |
Time Limit Exceeded |
0 |
|
|
19 |
4
|
6087.4 |
35804 |
Time Limit Exceeded |
0 |
|
|
20 |
4
|
6053.6 |
35936 |
Time Limit Exceeded |
0 |
|
|
21 |
4
|
6056.4 |
35936 |
Time Limit Exceeded |
0 |
|
|
22 |
4
|
6056.4 |
35936 |
Time Limit Exceeded |
0 |
|
|
23 |
4
|
6060.3 |
34760 |
Time Limit Exceeded |
0 |
|
|
24 |
4
|
6053.4 |
34760 |
Time Limit Exceeded |
0 |
|
|
25 |
4
|
6053.6 |
33440 |
Time Limit Exceeded |
0 |
|
|
26 |
4
|
6063.3 |
33968 |
Time Limit Exceeded |
0 |
|
|
27 |
4
|
6057.6 |
35420 |
Time Limit Exceeded |
0 |
|
|
Submitter:
Compiler:
c++17
Code Length:
1.26 KB
Back to Top