QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #861265 | #9980. Boolean Function Reconstruction | ucup-team4478# | WA | 1ms | 3712kb | C++20 | 1.8kb | 2025-01-18 16:43:38 | 2025-01-18 16:43:41 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3712kb
input:
7 2 0001 2 0111 2 1111 3 00010111 1 10 2 0101 5 00000000000000000000000000000001
output:
Yes (a&b) Yes (a|b) Yes T Yes ((c&(a|b))|(a&b)) No Yes a Yes ((e&((d&((c&(a&b))|F))|((c&F)|F)))|((d&((c&F)|F))|((c&F)|F)))
result:
ok 7 lines, tightest: 4 out of 14 (7 test cases)
Test #2:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
4 1 00 1 10 1 01 1 11
output:
Yes F No Yes a Yes T
result:
ok 4 lines, tightest: 0 out of 11 (4 test cases)
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3584kb
input:
16 2 0000 2 1000 2 0100 2 1100 2 0010 2 1010 2 0110 2 1110 2 0001 2 1001 2 0101 2 1101 2 0011 2 1011 2 0111 2 1111
output:
Yes F No No No No Yes b No No Yes (a&b) No Yes a No No No Yes (a|b) Yes T
result:
wrong answer 0-th bit is incorrect (test case 6)