QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#435100 | #2808. Gardening | egypt_ioi2024_11# | 0 | 27ms | 3772kb | C++23 | 1.2kb | 2024-06-08 18:52:51 | 2024-06-08 18:52:53 |
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: 4ms
memory: 3772kb
input:
28119 2 4 2 2 2 1 4 2 2 2 2 1 2 2 1 2 2 3 2 4 2 4 4 2 2 2 2 2 2 2 4 4 3 2 2 1 4 2 2 4 4 4 4 2 2 2 4 2 2 2 2 2 2 2 2 2 1 2 2 1 2 2 1 2 2 1 2 2 2 2 2 1 2 4 2 2 2 1 2 2 1 2 2 1 4 2 2 2 2 2 2 2 1 2 2 1 2 2 1 2 2 1 2 2 1 4 2 7 2 2 1 2 4 2 2 2 1 4 2 2 2 4 2 2 2 1 2 4 4 2 2 1 2 2 1 2 2 1 4 2 2 2 2 2 2 2 1 ...
output:
YES 1 1 2 2 1 1 2 2 YES 1 1 1 1 YES 2 2 2 2 2 2 2 2 YES 1 1 1 1 YES 1 1 1 1 NO YES 1 1 2 2 1 1 2 2 YES 2 2 2 2 2 1 1 2 2 1 1 2 2 2 2 2 NO NO YES 2 2 3 3 2 2 3 3 1 1 1 1 1 1 1 1 YES 1 1 1 1 YES 2 2 2 2 2 2 2 2 YES 3 3 4 4 3 3 4 4 1 1 2 2 1 1 2 2 YES 2 2 2 2 2 2 2 2 ...
result:
wrong answer Output does not contain all values between 1 and k (test case 3)
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Wrong Answer
Test #6:
score: 0
Wrong Answer
time: 27ms
memory: 3572kb
input:
311 2 2 1 12 12 14 6 6 6 40 40 297 28 28 82 30 30 74 4 4 10 38 38 210 6 6 4 42 42 365 8 8 11 16 16 30 6 6 7 22 22 38 10 10 5 2 2 2 12 12 19 16 16 52 28 28 124 26 26 92 2 2 2 28 28 25 20 20 19 18 18 43 4 4 3 30 30 78 26 26 130 18 18 58 26 26 59 6 6 4 10 10 6 14 14 34 18 18 184 12 12 108 18 18 35 30 3...
output:
YES 1 1 1 1 YES 14 14 14 14 14 14 14 14 14 14 14 14 14 13 13 13 13 13 13 13 13 13 13 14 14 13 9 9 10 10 11 11 12 12 13 14 14 13 9 9 10 10 11 11 12 12 13 14 14 13 5 5 6 6 7 7 8 8 13 14 14 13 5 5 6 6 7 7 8 8 13 14 14 13 4 4 4 4 4 4 4 4 13 14 14 13 4 1 1 2 2 3 3 4 13 14 14 13 4 1 1 2 2 3 3 4 ...
result:
wrong answer Output contains flowers without two equal neighbours (test case 5)
Subtask #5:
score: 0
Runtime Error
Test #19:
score: 0
Runtime Error
input:
310 44 2 22 36 8 195 2 2 4 2 50 61 12 42 275 4 4 5 26 30 416 24 20 252 20 32 498 30 30 130 32 48 1153 46 16 574 4 40 89 6 28 64 10 16 9 18 42 152 4 14 1 6 50 280 10 10 87 44 24 395 2 2 4 40 46 273 34 34 607 22 22 300 40 40 1166 10 48 211 42 22 334 6 10 20 38 38 189 6 10 36 14 14 33 44 48 1518 32 18 ...
output:
result:
Subtask #6:
score: 0
Skipped
Dependency #1:
0%