Results of submission #329244

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
9320
34736
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 3564 Accepted 100
1 1 2 3 4 0003.1 6200 3632 Accepted 100
2 2 3 4 0002.5 6200 3560 Accepted 100
3 2 3 4 0002.5 6200 3564 Accepted 100
4 2 3 4 0002.8 6200 3596 Accepted 100
5 2 3 4 0002.4 6200 3540 Accepted 100
6 2 3 4 0002.5 6200 3644 Accepted 100
7 3 4 0062.3 10872 6464 Accepted 100
8 3 4 0076.9 10872 6588 Accepted 100
9 3 4 0061.7 10872 6464 Accepted 100
10 3 4 0061.6 10872 6516 Accepted 100
11 3 4 0061.8 10872 6648 Accepted 100
12 3 4 0062.8 10872 6664 Accepted 100
13 3 4 0061.9 10872 6472 Accepted 100
14 3 4 0068.6 10872 6676 Accepted 100
15 3 4 0060.2 10872 6476 Accepted 100
16 3 4 0068.7 10872 6544 Accepted 100
17 3 4 0061.6 10872 6552 Accepted 100
18 3 4 0063.5 10872 6672 Accepted 100
19 3 4 0062.2 10872 6516 Accepted 100
20 3 4 0060.4 10872 6448 Accepted 100
21 3 4 0061.8 10872 6660 Accepted 100
22 3 4 0065.0 10872 6652 Accepted 100
23 3 4 0072.8 10872 6560 Accepted 100
24 4 0638.1 43128 34660 Accepted 100
25 4 0632.1 43128 34540 Accepted 100
26 4 0627.8 43128 34536 Accepted 100
27 4 0628.9 43128 34624 Accepted 100
28 4 0629.4 43128 34520 Accepted 100
29 4 0629.2 43128 34736 Accepted 100
30 4 0276.7 24696 17080 Accepted 100
31 4 0520.3 43128 29112 Accepted 100
32 4 0619.4 43128 34404 Accepted 100
33 4 0406.1 43128 23712 Accepted 100
34 4 0166.7 24696 13676 Accepted 100
35 4 0603.6 43128 34616 Accepted 100
36 4 0607.8 43128 34524 Accepted 100
37 4 0610.5 43128 34616 Accepted 100
38 4 0611.0 43128 34636 Accepted 100
Submitter:
RayPeng
Compiler:
c++17
Code Length:
814 Bytes
Back to Top