QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #505711 | #7157. Bikes vs Cars | hyforces# | 0 | 4ms | 4428kb | C++20 | 2.7kb | 2024-08-05 09:28:54 | 2024-08-05 09:28:55 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3772kb
input:
14 1000000 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 49...
output:
26 1 13 494185 2 3 494185 2 4 494185 2 5 494185 2 6 494185 2 7 494185 2 8 494185 2 9 494185 2 10 494185 2 11 494185 0 1 494185 2 13 494185 3 12 494185 1 13 463359 2 3 463359 2 4 463359 2 5 463359 2 6 463359 2 7 463359 2 8 463359 2 9 463359 2 10 463359 2 11 463359 0 1 463359 2 13 463359 3 12 463359
result:
wrong answer Min Max 1 - 0 not equal aij, is 463359, should be 505815
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Wrong Answer
Test #16:
score: 0
Wrong Answer
time: 0ms
memory: 3780kb
input:
14 1000000 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 49...
output:
26 1 13 494185 2 3 494185 2 4 494185 2 5 494185 2 6 494185 2 7 494185 2 8 494185 2 9 494185 2 10 494185 2 11 494185 0 1 494185 2 13 494185 3 12 494185 1 13 463359 2 3 463359 2 4 463359 2 5 463359 2 6 463359 2 7 463359 2 8 463359 2 9 463359 2 10 463359 2 11 463359 0 1 463359 2 13 463359 3 12 463359
result:
wrong answer Min Max 1 - 0 not equal aij, is 463359, should be 505815
Subtask #4:
score: 0
Wrong Answer
Test #39:
score: 0
Wrong Answer
time: 4ms
memory: 4428kb
input:
163 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 ...
output:
324 18 91 0 9 65 0 102 161 0 80 94 0 102 156 0 53 86 1 79 162 1 34 66 1 9 53 1 80 91 1 80 117 1 64 102 1 102 121 1 26 137 1 34 113 1 34 131 1 34 127 1 52 121 1 34 123 1 26 148 1 9 42 1 79 141 1 34 98 1 104 109 1 17 148 1 81 115 1 10 61 1 81 101 1 54 105 1 10 67 1 98 154 1 10 126 1 55 57 1 33 43 1 99...
result:
wrong answer Min Max 3 - 1 not equal aij, is 1, should be 0
Subtask #5:
score: 0
Skipped
Dependency #2:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
0%