Results of submission #329486

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2234. 2D Chess Without Multiverse Time Travel
8606
19256
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 21824 3556 Accepted 100
1 1 2 3 4 0002.6 21824 3576 Accepted 100
2 2 3 4 0002.7 21824 3596 Accepted 100
3 2 3 4 0002.4 21824 3580 Accepted 100
4 2 3 4 0002.5 21824 3472 Accepted 100
5 2 3 4 0002.4 21824 3556 Accepted 100
6 2 3 4 0002.6 21824 3700 Accepted 100
7 3 4 0054.5 21824 5140 Accepted 100
8 3 4 0055.6 21824 5124 Accepted 100
9 3 4 0054.6 21824 5200 Accepted 100
10 3 4 0054.1 21824 5028 Accepted 100
11 3 4 0054.8 21824 5028 Accepted 100
12 3 4 0055.9 21824 5136 Accepted 100
13 3 4 0058.7 21824 5204 Accepted 100
14 3 4 0054.2 21824 5028 Accepted 100
15 3 4 0053.3 21824 5256 Accepted 100
16 3 4 0059.7 21824 5032 Accepted 100
17 3 4 0067.3 21824 5128 Accepted 100
18 3 4 0057.7 21824 5196 Accepted 100
19 3 4 0054.7 21824 5260 Accepted 100
20 3 4 0079.1 21824 5156 Accepted 100
21 3 4 0057.3 21824 5028 Accepted 100
22 3 4 0054.9 21824 5120 Accepted 100
23 3 4 0057.4 21824 5132 Accepted 100
24 4 0755.0 21824 19188 Accepted 100
25 4 0575.2 21824 19212 Accepted 100
26 4 0647.3 21824 19192 Accepted 100
27 4 0577.1 21824 19256 Accepted 100
28 4 0568.7 21824 19184 Accepted 100
29 4 0568.6 21824 19188 Accepted 100
30 4 0248.3 21824 10640 Accepted 100
31 4 0459.0 21824 16484 Accepted 100
32 4 0554.8 21824 19132 Accepted 100
33 4 0347.2 21824 13388 Accepted 100
34 4 0141.6 21824 7600 Accepted 100
35 4 0536.0 21824 19208 Accepted 100
36 4 0539.3 21824 19184 Accepted 100
37 4 0546.3 21824 19032 Accepted 100
38 4 0540.3 21824 19208 Accepted 100
Submitter:
2022test
Compiler:
c++17
Code Length:
1.39 KB
Back to Top