NTUCPC Challenge! #1 題解公開! 連結
YTP 2025 題目已上線! 連結
程式解題社網站 程式解題社網站上線了!
Rejudge 公告 23 已加強測資並 rejudge
Back to Submissions List
Problem
Total Time (ms)
Score
91432
26496
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
|
0002.5 |
6516 |
Accepted |
100 |
|
|
1 |
1
2
4
|
0003.9 |
6516 |
Wrong Answer |
0 |
|
|
2 |
1
2
4
|
0003.8 |
6516 |
Wrong Answer |
0 |
|
|
3 |
2
4
|
0042.2 |
7440 |
Wrong Answer |
0 |
|
|
4 |
2
4
|
0040.9 |
7440 |
Accepted |
100 |
|
|
5 |
2
4
|
0042.3 |
7440 |
Wrong Answer |
0 |
|
|
6 |
2
4
|
0042.3 |
7440 |
Wrong Answer |
0 |
|
|
7 |
2
4
|
0044.2 |
7440 |
Wrong Answer |
0 |
|
|
8 |
2
4
|
0041.7 |
7440 |
Wrong Answer |
0 |
|
|
9 |
2
4
|
0043.3 |
7440 |
Wrong Answer |
0 |
|
|
10 |
2
4
|
0041.1 |
7440 |
Wrong Answer |
0 |
|
|
11 |
2
4
|
0034.8 |
7440 |
Wrong Answer |
0 |
|
|
12 |
2
4
|
0033.8 |
7440 |
Wrong Answer |
0 |
|
|
13 |
3
4
|
6073.4 |
31464 |
Time Limit Exceeded |
0 |
|
|
14 |
3
4
|
6065.4 |
31464 |
Time Limit Exceeded |
0 |
|
|
15 |
3
4
|
6060.0 |
31464 |
Time Limit Exceeded |
0 |
|
|
16 |
3
4
|
6088.9 |
31464 |
Time Limit Exceeded |
0 |
|
|
17 |
3
4
|
6074.7 |
31464 |
Time Limit Exceeded |
0 |
|
|
18 |
3
4
|
6066.2 |
31464 |
Time Limit Exceeded |
0 |
|
|
19 |
4
|
6057.5 |
31464 |
Time Limit Exceeded |
0 |
|
|
20 |
4
|
6057.7 |
31464 |
Time Limit Exceeded |
0 |
|
|
21 |
4
|
6080.0 |
31464 |
Time Limit Exceeded |
0 |
|
|
22 |
4
|
6073.7 |
31464 |
Time Limit Exceeded |
0 |
|
|
23 |
4
|
6072.7 |
31464 |
Time Limit Exceeded |
0 |
|
|
24 |
4
|
6061.2 |
31464 |
Time Limit Exceeded |
0 |
|
|
25 |
4
|
6063.1 |
31464 |
Time Limit Exceeded |
0 |
|
|
26 |
4
|
6061.9 |
31464 |
Time Limit Exceeded |
0 |
|
|
27 |
4
|
6058.6 |
31464 |
Time Limit Exceeded |
0 |
|
|
Submitter:
Compiler:
c++17
Code Length:
792 Bytes
Back to Top