QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #112066 | #1861. Nondeterministic Finite Automaton | SegmentTree | WA | 2ms | 3356kb | C++17 | 1.5kb | 2023-06-09 18:20:43 | 2023-06-09 18:20:46 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3316kb
input:
6
output:
9 0 0 0 1 0 2 0 4 1 3 2 1 3 5 4 2 5 4 13 0 1 0 2 0 3 0 4 0 5 1 2 1 5 2 1 2 4 2 5 3 2 5 2 5 4 6 0 1 2 3 4 5
result:
ok n = 6
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3356kb
input:
20
output:
23 0 1 0 4 0 8 0 13 1 2 2 3 3 1 4 2 5 3 6 4 7 1 8 2 9 3 10 4 11 5 12 1 13 2 14 3 15 4 16 5 17 6 18 7 19 1 23 0 1 0 4 0 8 0 13 1 2 2 3 3 1 4 2 5 3 6 4 7 1 8 2 9 3 10 4 11 5 12 1 13 2 14 3 15 4 16 5 17 6 18 7 19 1 16 0 1 2 4 5 6 8 9 10 11 13 14 15 16 17 18
result:
wrong answer n = 20, l = 3 is to small