Results of submission #319111

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
5652
17040
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~1 範例測資。 0 / 0
2 0~6 $N < 100, |x_i|, |y_i| < 1000$ 34 / 34
3 0~23 $N < 10^ 5, |x_i|, |y_i| < 10^ 9$ 31 / 31
4 0~38 $N < 10^ 6, |x_i|, |y_i| < 10^ 9$ 35 / 35

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 2 3 4 0001.2 18332 1252 Accepted 100
1 1 2 3 4 0001.2 18332 1224 Accepted 100
2 2 3 4 0001.3 18332 1208 Accepted 100
3 2 3 4 0001.3 18332 1212 Accepted 100
4 2 3 4 0001.3 18332 1208 Accepted 100
5 2 3 4 0001.2 18332 1248 Accepted 100
6 2 3 4 0001.3 18332 1220 Accepted 100
7 3 4 0035.6 18332 2992 Accepted 100
8 3 4 0035.7 18332 2848 Accepted 100
9 3 4 0035.6 18332 2836 Accepted 100
10 3 4 0035.5 18332 2880 Accepted 100
11 3 4 0035.6 18332 2992 Accepted 100
12 3 4 0037.1 18332 2880 Accepted 100
13 3 4 0036.7 18332 2992 Accepted 100
14 3 4 0035.2 18332 2868 Accepted 100
15 3 4 0034.5 18332 2888 Accepted 100
16 3 4 0036.6 18332 2988 Accepted 100
17 3 4 0036.2 18332 2948 Accepted 100
18 3 4 0036.5 18332 2856 Accepted 100
19 3 4 0036.3 18332 2948 Accepted 100
20 3 4 0035.0 18332 2920 Accepted 100
21 3 4 0034.5 18332 2888 Accepted 100
22 3 4 0036.9 18332 2828 Accepted 100
23 3 4 0036.1 18332 2984 Accepted 100
24 4 0391.2 18332 17036 Accepted 100
25 4 0390.4 18332 16892 Accepted 100
26 4 0389.6 18332 16876 Accepted 100
27 4 0394.0 18332 16900 Accepted 100
28 4 0390.8 18332 16880 Accepted 100
29 4 0389.1 18332 16884 Accepted 100
30 4 0167.6 18332 8348 Accepted 100
31 4 0319.1 18332 14108 Accepted 100
32 4 0391.1 18332 16800 Accepted 100
33 4 0239.2 18332 11236 Accepted 100
34 4 0097.3 18332 5484 Accepted 100
35 4 0366.8 18332 17040 Accepted 100
36 4 0367.9 18332 16924 Accepted 100
37 4 0369.8 18332 16880 Accepted 100
38 4 0369.8 18332 16876 Accepted 100
Submitter:
Caido
Compiler:
c++17
Code Length:
1.29 KB
Back to Top