Results of submission #291317

Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
8470
22756
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 0002.6 6208 3572 Accepted 100
1 1 2 3 4 0002.6 6208 3560 Accepted 100
2 2 3 4 0002.6 6208 3536 Accepted 100
3 2 3 4 0002.7 6208 3564 Accepted 100
4 2 3 4 0002.6 6208 3540 Accepted 100
5 2 3 4 0002.5 6208 3404 Accepted 100
6 2 3 4 0002.6 6208 3520 Accepted 100
7 3 4 0055.9 8168 5004 Accepted 100
8 3 4 0055.9 8168 5076 Accepted 100
9 3 4 0055.9 8168 5068 Accepted 100
10 3 4 0056.7 8168 5068 Accepted 100
11 3 4 0056.0 8168 5008 Accepted 100
12 3 4 0056.5 8168 4924 Accepted 100
13 3 4 0056.2 8168 5020 Accepted 100
14 3 4 0055.0 8168 5008 Accepted 100
15 3 4 0054.5 8168 4904 Accepted 100
16 3 4 0055.7 8168 4928 Accepted 100
17 3 4 0055.8 8168 5012 Accepted 100
18 3 4 0056.2 8168 5072 Accepted 100
19 3 4 0056.1 8168 5016 Accepted 100
20 3 4 0055.0 8168 5008 Accepted 100
21 3 4 0055.0 8168 5012 Accepted 100
22 3 4 0057.9 8168 5016 Accepted 100
23 3 4 0055.7 8168 4960 Accepted 100
24 4 0576.9 25748 22648 Accepted 100
25 4 0577.2 25748 22716 Accepted 100
26 4 0576.7 25748 22696 Accepted 100
27 4 0581.2 25748 22708 Accepted 100
28 4 0581.7 25748 22636 Accepted 100
29 4 0578.1 25748 22612 Accepted 100
30 4 0252.2 14968 11828 Accepted 100
31 4 0476.2 22268 19288 Accepted 100
32 4 0573.9 25588 22448 Accepted 100
33 4 0358.4 18488 15260 Accepted 100
34 4 0147.3 11388 8504 Accepted 100
35 4 0554.2 25748 22700 Accepted 100
36 4 0556.6 25748 22608 Accepted 100
37 4 0555.2 25748 22756 Accepted 100
38 4 0555.6 25748 22680 Accepted 100
Submitter:
alvingogo
Compiler:
c++14
Code Length:
658 Bytes
Back to Top