Results of submission #397908

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
9532
34672
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 6212 3500 Accepted 100
1 1 2 3 4 0002.5 6212 3584 Accepted 100
2 2 3 4 0002.6 6212 3504 Accepted 100
3 2 3 4 0002.7 6212 3512 Accepted 100
4 2 3 4 0002.6 6212 3512 Accepted 100
5 2 3 4 0002.7 6212 3552 Accepted 100
6 2 3 4 0002.6 6212 3640 Accepted 100
7 3 4 0062.9 10884 6564 Accepted 100
8 3 4 0063.9 10884 6556 Accepted 100
9 3 4 0063.5 10884 6476 Accepted 100
10 3 4 0063.8 10884 6472 Accepted 100
11 3 4 0063.4 10884 6612 Accepted 100
12 3 4 0062.5 10884 6476 Accepted 100
13 3 4 0062.4 10884 6592 Accepted 100
14 3 4 0061.4 10884 6592 Accepted 100
15 3 4 0060.1 10884 6540 Accepted 100
16 3 4 0063.5 10884 6428 Accepted 100
17 3 4 0062.7 10884 6584 Accepted 100
18 3 4 0064.4 10884 6520 Accepted 100
19 3 4 0064.2 10884 6588 Accepted 100
20 3 4 0060.7 10884 6604 Accepted 100
21 3 4 0062.0 10884 6472 Accepted 100
22 3 4 0062.6 10884 6568 Accepted 100
23 3 4 0063.1 10884 6472 Accepted 100
24 4 0648.8 43140 34672 Accepted 100
25 4 0657.2 43140 34500 Accepted 100
26 4 0647.7 43140 34652 Accepted 100
27 4 0681.1 43140 34536 Accepted 100
28 4 0641.5 43140 34544 Accepted 100
29 4 0644.8 43140 34656 Accepted 100
30 4 0285.0 24708 17064 Accepted 100
31 4 0536.9 43140 29060 Accepted 100
32 4 0651.0 43140 34292 Accepted 100
33 4 0411.9 43140 23848 Accepted 100
34 4 0175.4 24708 13488 Accepted 100
35 4 0608.6 43140 34500 Accepted 100
36 4 0618.4 43140 34636 Accepted 100
37 4 0623.8 43140 34532 Accepted 100
38 4 0614.8 43140 34580 Accepted 100
Submitter:
huangallen
Compiler:
c++17
Code Length:
1.31 KB
Back to Top