QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #33068 | #3837. The Matching System | SuffixTree | WA | 3ms | 8704kb | C++17 | 1.6kb | 2022-05-27 11:01:34 | 2022-05-27 11:01:36 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 8616kb
input:
3
output:
*0* 011 8 *1* 001 7
result:
ok Accepted
Test #2:
score: 0
Accepted
time: 1ms
memory: 3520kb
input:
1
output:
* 0 1 * 0 2
result:
ok Accepted
Test #3:
score: -100
Wrong Answer
time: 3ms
memory: 8704kb
input:
2
output:
0* 01 2 *1 01 4
result:
wrong answer Your enery cost in the maximum mathing method is not the best