Results of submission #294167

Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
9297
15368
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.4 6208 3544 Accepted 100
1 1 2 3 4 0002.4 6208 3452 Accepted 100
2 2 3 4 0002.4 6208 3432 Accepted 100
3 2 3 4 0002.6 6208 3452 Accepted 100
4 2 3 4 0002.5 6208 3532 Accepted 100
5 2 3 4 0002.5 6208 3596 Accepted 100
6 2 3 4 0002.7 6208 3520 Accepted 100
7 3 4 0057.8 7256 4500 Accepted 100
8 3 4 0058.1 7256 4704 Accepted 100
9 3 4 0057.8 7260 4684 Accepted 100
10 3 4 0058.1 7260 4644 Accepted 100
11 3 4 0058.5 7256 4680 Accepted 100
12 3 4 0061.9 7256 4728 Accepted 100
13 3 4 0062.2 7260 4544 Accepted 100
14 3 4 0063.2 7260 4824 Accepted 100
15 3 4 0063.3 7260 4832 Accepted 100
16 3 4 0060.5 7256 4688 Accepted 100
17 3 4 0062.6 7260 4764 Accepted 100
18 3 4 0061.4 7256 4736 Accepted 100
19 3 4 0062.4 7256 4820 Accepted 100
20 3 4 0063.2 7256 4684 Accepted 100
21 3 4 0063.0 7256 4604 Accepted 100
22 3 4 0060.3 7256 4688 Accepted 100
23 3 4 0062.6 7256 4684 Accepted 100
24 4 0612.6 17804 15276 Accepted 100
25 4 0607.1 17804 15228 Accepted 100
26 4 0607.5 17808 15272 Accepted 100
27 4 0608.3 17804 15308 Accepted 100
28 4 0610.5 17804 15236 Accepted 100
29 4 0613.8 17804 15248 Accepted 100
30 4 0266.2 11328 8788 Accepted 100
31 4 0491.5 15716 13140 Accepted 100
32 4 0604.8 17704 15208 Accepted 100
33 4 0377.4 13440 11004 Accepted 100
34 4 0153.7 9180 6608 Accepted 100
35 4 0673.1 17804 15368 Accepted 100
36 4 0669.8 17808 15312 Accepted 100
37 4 0673.8 17804 15264 Accepted 100
38 4 0672.8 17800 15224 Accepted 100
Submitter:
linki1010111
Compiler:
c++14
Code Length:
1.22 KB
Back to Top