Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

20276
5304
Runtime Error (killed by signal)
2

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0 範例測資 2 / 2
2 1~7 $\forall i, j \ (1 \leq i \lt j \leq n) \implies d_i \neq d_j$ 0 / 8
3 8~14 $\forall i, j \ (1 \leq i \lt j \leq n) \implies r_i = r_j$ 0 / 12
4 15~21 $\forall i, j\ (1 \leq i,j \leq n) \quad d_i \lt d_j \implies r_i \gt r_j$ 0 / 18
5 0~30 無其他限制 0 / 60

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 5 0006.7 7780 5104 Accepted 100
1 2 5 0421.4 7784 4836 Runtime Error (killed by signal) 0
2 2 5 0415.4 7788 4736 Runtime Error (killed by signal) 0
3 2 5 0418.7 7780 4908 Runtime Error (killed by signal) 0
4 2 5 1081.7 7784 4916 Time Limit Exceeded 0
5 2 5 1064.4 7784 4788 Time Limit Exceeded 0
6 2 5 1065.1 7784 4900 Time Limit Exceeded 0
7 2 5 1099.2 7788 4836 Time Limit Exceeded 0
8 3 5 0010.6 7780 5304 Accepted 100
9 3 5 0007.2 7788 5164 Accepted 100
10 3 5 0028.2 7780 5260 Wrong Answer 0
11 3 5 1098.1 7784 4788 Time Limit Exceeded 0
12 3 5 0388.8 7780 4784 Runtime Error (killed by signal) 0
13 3 5 1085.6 7780 4824 Time Limit Exceeded 0
14 3 5 1093.3 7780 4908 Time Limit Exceeded 0
15 4 5 0424.8 7784 4812 Runtime Error (killed by signal) 0
16 4 5 0415.1 7784 4832 Runtime Error (killed by signal) 0
17 4 5 0408.0 7784 4836 Runtime Error (killed by signal) 0
18 4 5 1053.4 7784 4836 Time Limit Exceeded 0
19 4 5 1056.6 7784 4684 Time Limit Exceeded 0
20 4 5 1097.9 7780 4828 Time Limit Exceeded 0
21 4 5 1066.5 7784 4836 Time Limit Exceeded 0
22 5 0008.2 7784 5220 Accepted 100
23 5 0009.2 7784 5084 Accepted 100
24 5 0047.0 7788 5224 Accepted 100
25 5 1074.1 7784 4836 Time Limit Exceeded 0
26 5 1078.8 7784 4820 Time Limit Exceeded 0
27 5 1085.8 7780 4808 Time Limit Exceeded 0
28 5 1081.4 7780 4804 Time Limit Exceeded 0
29 5 1079.0 7788 4836 Time Limit Exceeded 0
30 5 0006.3 7780 5208 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
865 Bytes
Back to Top