QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#45586 | #4565. Rarest Insects | ZhaoZiLong | 0 | 305ms | 3844kb | C++17 | 964b | 2022-08-24 13:13:31 | 2022-08-24 13:13:32 |
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: 10
Accepted
time: 3ms
memory: 3836kb
input:
6 1 1 1 2 2 3 2 1 2 2 3
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 1 3 8 1 5 8 2 8 1 4 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 1 5 8 3 1
result:
ok
Test #2:
score: 0
Accepted
time: 2ms
memory: 3696kb
input:
2 1 2 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 2 8 0 1 8 2 8 3 2
result:
ok
Test #3:
score: 0
Accepted
time: 1ms
memory: 3832kb
input:
2 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 3 1
result:
ok
Test #4:
score: 0
Accepted
time: 3ms
memory: 3752kb
input:
3 1 1 2 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 2 8 0 2 8 2 8 3 1
result:
ok
Test #5:
score: 0
Accepted
time: 3ms
memory: 3700kb
input:
5 1 1 2 2 3 2 1 2 2 3 3
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 1 2 8 1 4 8 2 8 1 3 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 1 4 8 0 4 8 2 8 3 2
result:
ok
Test #6:
score: -10
Wrong Answer
time: 211ms
memory: 3760kb
input:
8 1 1 2 3 4 5 5 5 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 0 6 8 2 8 0 7 8 2 8 1 2 8 1 3 8 1 4 8 1 5 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 8 2 ...
result:
wrong answer Too many queries.
Subtask #2:
score: 0
Wrong Answer
Test #24:
score: 0
Wrong Answer
time: 305ms
memory: 3660kb
input:
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101...
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 0 6 8 2 8 0 7 8 2 8 0 8 8 2 8 0 9 8 2 8 0 10 8 2 8 0 11 8 2 8 0 12 8 2 8 0 13 8 2 8 0 14 8 2 8 0 15 8 2 8 0 16 8 2 8 0 17 8 2 8 0 18 8 2 8 0 19 8 2 8 0 20 8 2 8 0 21 8 2 8 0 22 8 2 8 0 23 8 2 8 0 24 8 2 8 0 25 8 2 8 0 26 8 2 8 0 27 8 2 8 ...
result:
wrong answer Too many queries.
Subtask #3:
score: 0
Wrong Answer
Test #43:
score: 75
Accepted
time: 1ms
memory: 3732kb
input:
2 1 2 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 2 8 0 1 8 2 8 3 2
result:
ok
Test #44:
score: 75
Accepted
time: 1ms
memory: 3756kb
input:
2 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 3 1
result:
ok
Test #45:
score: 75
Accepted
time: 2ms
memory: 3844kb
input:
3 1 1 2 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 2 8 0 2 8 2 8 3 1
result:
ok
Test #46:
score: 0
Wrong Answer
time: 3ms
memory: 3752kb
input:
6 1 2 2 3 4 5 1 2 3 3 3 3 4 4 4 5 5
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 1 1 8 1 3 8 1 4 8 1 5 8 2 8 0 1 8 2 8 0 3 8 2 8 1 3 8 0 4 8 2 8 1 4 8 0 5 8 2 8 1 5 8 0 3 8 2 8 0 4 8 2 8 1 4 8 0 5 8 2 8 1 5 8 0 4 8 2 8 0 5 8 2 8 1 5 8 0 5 8 2 8 3 5
result:
wrong answer Wrong answer.