Results of submission #346983

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
9315
34728
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.5 6200 3588 Accepted 100
1 1 2 3 4 0002.4 6200 3516 Accepted 100
2 2 3 4 0002.5 6200 3592 Accepted 100
3 2 3 4 0002.6 6200 3704 Accepted 100
4 2 3 4 0002.6 6200 3700 Accepted 100
5 2 3 4 0002.5 6200 3632 Accepted 100
6 2 3 4 0002.5 6200 3704 Accepted 100
7 3 4 0061.3 10872 6500 Accepted 100
8 3 4 0061.8 10872 6672 Accepted 100
9 3 4 0061.4 10872 6600 Accepted 100
10 3 4 0062.1 10872 6500 Accepted 100
11 3 4 0061.6 10872 6452 Accepted 100
12 3 4 0062.1 10872 6508 Accepted 100
13 3 4 0062.0 10872 6668 Accepted 100
14 3 4 0060.4 10872 6540 Accepted 100
15 3 4 0060.1 10872 6512 Accepted 100
16 3 4 0062.1 10872 6500 Accepted 100
17 3 4 0061.6 10872 6512 Accepted 100
18 3 4 0063.2 10872 6648 Accepted 100
19 3 4 0062.2 10872 6500 Accepted 100
20 3 4 0060.4 10872 6460 Accepted 100
21 3 4 0060.0 10872 6604 Accepted 100
22 3 4 0062.4 10872 6476 Accepted 100
23 3 4 0061.5 10872 6624 Accepted 100
24 4 0625.4 43128 34680 Accepted 100
25 4 0629.6 43128 34616 Accepted 100
26 4 0625.4 43128 34676 Accepted 100
27 4 0632.5 43128 34608 Accepted 100
28 4 0626.8 43128 34520 Accepted 100
29 4 0628.4 43128 34720 Accepted 100
30 4 0275.7 24696 17136 Accepted 100
31 4 0518.9 43128 29072 Accepted 100
32 4 0622.4 43128 34404 Accepted 100
33 4 0438.7 43128 23828 Accepted 100
34 4 0168.8 24696 13680 Accepted 100
35 4 0608.8 43128 34656 Accepted 100
36 4 0608.3 43128 34728 Accepted 100
37 4 0619.3 43128 34532 Accepted 100
38 4 0622.5 43128 34724 Accepted 100
Submitter:
PixelCat
Compiler:
c++17
Code Length:
833 Bytes
Back to Top