Results of submission #324261

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2183. 保護女王 (Queen)
352
2540
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~19 $6 \leq n \leq 3000$ 25 / 25
2 0~29 $20000 \leq n \leq 50000$，且以 x 坐標大小區分出的 A 與 B 兩群點，各自凸包 (convex hull) 上的頂點數不超過 $3000$ 40 / 40
3 0~39 $60000 \leq n \leq 100000$ 35 / 35

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 2 3 0002.9 3620 1704 Accepted 100
1 1 2 3 0002.7 3620 1760 Accepted 100
2 1 2 3 0001.7 3620 1772 Accepted 100
3 1 2 3 0002.1 3620 1768 Accepted 100
4 1 2 3 0002.3 3620 1804 Accepted 100
5 1 2 3 0001.6 3620 1708 Accepted 100
6 1 2 3 0001.9 3620 1796 Accepted 100
7 1 2 3 0001.3 3620 1708 Accepted 100
8 1 2 3 0001.8 3620 1716 Accepted 100
9 1 2 3 0001.5 3620 1616 Accepted 100
10 1 2 3 0001.4 3620 1692 Accepted 100
11 1 2 3 0001.3 3620 1668 Accepted 100
12 1 2 3 0001.4 3620 1692 Accepted 100
13 1 2 3 0001.8 3620 1756 Accepted 100
14 1 2 3 0001.9 3620 1712 Accepted 100
15 1 2 3 0001.4 3620 1656 Accepted 100
16 1 2 3 0002.0 3620 1720 Accepted 100
17 1 2 3 0001.7 3620 1748 Accepted 100
18 1 2 3 0001.6 3620 1728 Accepted 100
19 1 2 3 0002.0 3620 1776 Accepted 100
20 2 3 0011.1 3620 2136 Accepted 100
21 2 3 0008.2 3620 2028 Accepted 100
22 2 3 0009.5 3620 1952 Accepted 100
23 2 3 0010.0 3620 1944 Accepted 100
24 2 3 0016.2 3620 1972 Accepted 100
25 2 3 0008.3 3620 2004 Accepted 100
26 2 3 0010.7 3620 1952 Accepted 100
27 2 3 0010.3 3620 1968 Accepted 100
28 2 3 0009.2 3620 2084 Accepted 100
29 2 3 0010.9 3620 1992 Accepted 100
30 3 0017.6 3620 2272 Accepted 100
31 3 0019.9 3620 2344 Accepted 100
32 3 0019.5 3620 2232 Accepted 100
33 3 0023.6 3620 2468 Accepted 100
34 3 0018.5 3620 2240 Accepted 100
35 3 0026.0 3620 2416 Accepted 100
36 3 0017.2 3620 2236 Accepted 100
37 3 0019.7 3620 2368 Accepted 100
38 3 0023.9 3620 2452 Accepted 100
39 3 0025.4 3620 2540 Accepted 100
Submitter:
Caido
Compiler:
c++17
Code Length:
2.43 KB
Back to Top