QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #861875 | #9980. Boolean Function Reconstruction | ucup-team1782# | WA | 0ms | 3840kb | C++14 | 1.4kb | 2025-01-18 20:23:25 | 2025-01-18 20:23:32 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3840kb
input:
7 2 0001 2 0111 2 1111 3 00010111 1 10 2 0101 5 00000000000000000000000000000001
output:
Yes (b&a) Yes (a|b) Yes T Yes ((b&a)|(c&(a|b))) No Yes a Yes (e&(d&(c&(b&a))))
result:
ok 7 lines, tightest: 4 out of 14 (7 test cases)
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3840kb
input:
4 1 00 1 10 1 01 1 11
output:
Yes FNo Yes a Yes T
result:
wrong answer Token parameter [name=expression] equals to "FNo", doesn't correspond to pattern "[a-z()TF&\|]+" (test case 1)