Results of submission #3194

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

37. 魔法鎮的魔法攻擊 (magic_attack)
4313
7296
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~2 範例測試資料 0 / 0
2 3~10 輸入滿足 $n,\ m = 1$。 5 / 5
3 0~20 輸入滿足 $1 \le n,\ m \le 10$。 10 / 10
4 21~30 輸入滿足 $ty_i = 1$。 30 / 30
5 0~40 無額外限制。 55 / 55

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 3 5 0003.2 7684 3712 Accepted 100
1 1 3 5 0003.3 7684 3584 Accepted 100
2 1 3 5 0003.4 7684 3712 Accepted 100
3 2 3 5 0109.9 7684 4608 Accepted 100
4 2 3 5 0092.4 7684 4608 Accepted 100
5 2 3 5 0089.1 7684 4736 Accepted 100
6 2 3 5 0040.4 7684 4736 Accepted 100
7 2 3 5 0007.2 7684 4736 Accepted 100
8 2 3 5 0104.9 7684 4736 Accepted 100
9 2 3 5 0076.7 7684 4608 Accepted 100
10 2 3 5 0109.1 7684 4736 Accepted 100
11 3 5 0036.1 7684 4736 Accepted 100
12 3 5 0014.6 7684 4736 Accepted 100
13 3 5 0101.2 7684 4608 Accepted 100
14 3 5 0080.3 7684 4736 Accepted 100
15 3 5 0054.1 7684 4736 Accepted 100
16 3 5 0021.4 7684 4608 Accepted 100
17 3 5 0121.0 7684 4608 Accepted 100
18 3 5 0123.0 7684 4608 Accepted 100
19 3 5 0066.6 7684 4736 Accepted 100
20 3 5 0030.4 7684 4736 Accepted 100
21 4 5 0296.7 10456 7296 Accepted 100
22 4 5 0083.7 8080 4872 Accepted 100
23 4 5 0081.1 9400 6144 Accepted 100
24 4 5 0296.7 9400 6144 Accepted 100
25 4 5 0120.0 7948 4988 Accepted 100
26 4 5 0079.1 7948 4992 Accepted 100
27 4 5 0032.1 7684 4736 Accepted 100
28 4 5 0170.0 7684 4864 Accepted 100
29 4 5 0279.5 9664 6400 Accepted 100
30 4 5 0109.6 8476 5248 Accepted 100
31 5 0073.8 7684 4864 Accepted 100
32 5 0033.8 7816 4864 Accepted 100
33 5 0206.5 8476 5248 Accepted 100
34 5 0138.3 7684 4736 Accepted 100
35 5 0102.7 7816 4864 Accepted 100
36 5 0162.7 9796 6656 Accepted 100
37 5 0097.1 9796 5888 Accepted 100
38 5 0207.2 8740 5504 Accepted 100
39 5 0151.6 8740 5504 Accepted 100
40 5 0302.6 10192 7040 Accepted 100
Submitter:
nailong
Compiler:
c++23
Code Length:
3.27 KB
Back to Top