Results of submission #347897

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
11197
34740
Wrong Answer
0

Subtask Results

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

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 2 3 4 0002.6 6200 3584 Accepted 100
1 1 2 3 4 0002.4 6200 3632 Accepted 100
2 2 3 4 0002.5 6200 3580 Wrong Answer 0
3 2 3 4 0002.4 6200 3584 Accepted 100
4 2 3 4 0002.6 6200 3632 Accepted 100
5 2 3 4 0002.6 6200 3600 Accepted 100
6 2 3 4 0002.5 6200 3492 Accepted 100
7 3 4 0072.3 10872 6560 Accepted 100
8 3 4 0072.2 10872 6620 Accepted 100
9 3 4 0072.1 10872 6452 Accepted 100
10 3 4 0072.2 10872 6448 Accepted 100
11 3 4 0072.2 10872 6472 Accepted 100
12 3 4 0072.9 10872 6460 Accepted 100
13 3 4 0072.5 10872 6656 Accepted 100
14 3 4 0071.7 10872 6460 Accepted 100
15 3 4 0070.9 10872 6596 Accepted 100
16 3 4 0072.1 10872 6548 Accepted 100
17 3 4 0072.1 10872 6408 Accepted 100
18 3 4 0072.4 10872 6552 Wrong Answer 0
19 3 4 0072.3 10872 6676 Accepted 100
20 3 4 0071.1 10872 6652 Accepted 100
21 3 4 0070.8 10872 6496 Accepted 100
22 3 4 0072.4 10872 6656 Accepted 100
23 3 4 0072.4 10872 6544 Accepted 100
24 4 0759.8 43128 34668 Accepted 100
25 4 0760.9 43128 34688 Accepted 100
26 4 0758.8 43128 34620 Accepted 100
27 4 0762.7 43128 34528 Wrong Answer 0
28 4 0761.9 43128 34716 Accepted 100
29 4 0758.0 43128 34580 Accepted 100
30 4 0333.5 24696 17256 Accepted 100
31 4 0637.1 43128 28968 Accepted 100
32 4 0757.2 43128 34268 Accepted 100
33 4 0481.6 43128 23756 Accepted 100
34 4 0200.3 24696 13572 Accepted 100
35 4 0742.6 43128 34568 Wrong Answer 0
36 4 0746.5 43128 34740 Accepted 100
37 4 0748.0 43128 34520 Wrong Answer 0
38 4 0745.7 43128 34724 Accepted 100
Submitter:
bo_u
Compiler:
c++17
Code Length:
1.77 KB
Back to Top