QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#871421	#9980. Boolean Function Reconstruction	ucup-team6380^#	WA	6ms	3712kb	C++14	2.1kb	2025-01-25 20:40:49	2025-01-25 20:41:19

Due to the privacy settings of the submitter, you are not allowed to view this code.

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3712kb

input:

7
2
0001
2
0111
2
1111
3
00010111
1
10
2
0101
5
00000000000000000000000000000001

output:

Yes
(a&(b|F))
Yes
(a|(b|F))
Yes
T
Yes
((a&(b|(c|F)))|(b&(c|F)))
No
Yes
(a|F)
Yes
(a&(b&(c&(d&(e|F)))))

result:

ok 7 lines, tightest: 6 out of 14 (7 test cases)

Test #2:

score: 0

Accepted

time: 1ms

memory: 3584kb

input:

output:

Yes
F
No
Yes
(a|F)
Yes
T

result:

ok 4 lines, tightest: 1 out of 11 (4 test cases)

Test #3:

score: 0

Accepted

time: 0ms

memory: 3584kb

input:

output:

Yes
F
No
No
No
No
No
No
No
Yes
(a&(b|F))
No
Yes
(a|F)
No
Yes
((a&(b|F))|(b|F))
No
Yes
(a|(b|F))
Yes
T

result:

ok 16 lines, tightest: 4 out of 12 (16 test cases)

Test #4:

score: 0

Accepted

time: 0ms

memory: 3712kb

input:

256
3
00000000
3
10000000
3
01000000
3
11000000
3
00100000
3
10100000
3
01100000
3
11100000
3
00010000
3
10010000
3
01010000
3
11010000
3
00110000
3
10110000
3
01110000
3
11110000
3
00001000
3
10001000
3
01001000
3
11001000
3
00101000
3
10101000
3
01101000
3
11101000
3
00011000
3
10011000
3
01011000...

output:

Yes
F
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
...

result:

ok 256 lines, tightest: 10 out of 14 (256 test cases)

Test #5:

score: -100

Wrong Answer

time: 6ms

memory: 3584kb

input:

65536
4
0000000000000000
4
1000000000000000
4
0100000000000000
4
1100000000000000
4
0010000000000000
4
1010000000000000
4
0110000000000000
4
1110000000000000
4
0001000000000000
4
1001000000000000
4
0101000000000000
4
1101000000000000
4
0011000000000000
4
1011000000000000
4
0111000000000000
4
1111000...

output:

Yes
F
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
...

result:

wrong answer 20 operations, you can't use more than 18 operations (test case 65025)