QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#861612	#9980. Boolean Function Reconstruction	ucup-team3215^#	TL	9ms	3968kb	C++23	2.9kb	2025-01-18 18:35:29	2025-01-18 18:35:41

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
(b&a)
Yes
(a|(b&T))
Yes
T
Yes
((b&a)|(c&(a|(b&T))))
No
Yes
a
Yes
(e&(d&(c&(b&a))))

result:

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

Test #2:

score: 0

Accepted

time: 0ms

memory: 3584kb

input:

output:

Yes
F
No
Yes
a
Yes
T

result:

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

Test #3:

score: 0

Accepted

time: 0ms

memory: 3712kb

input:

output:

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

result:

ok 16 lines, tightest: 2 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: 5 out of 14 (256 test cases)

Test #5:

score: 0

Accepted

time: 9ms

memory: 3712kb

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:

ok 65536 lines, tightest: 11 out of 18 (65536 test cases)

Test #6:

score: 0

Accepted

time: 0ms

memory: 3712kb

input:

168
4
0000000000000000
4
0000000000000001
4
0000000000000011
4
0000000000000101
4
0000000000000111
4
0000000000001111
4
0000000000010001
4
0000000000010011
4
0000000000010101
4
0000000000010111
4
0000000000011111
4
0000000000110011
4
0000000000110111
4
0000000000111111
4
0000000001010101
4
000000000...

output:

Yes
F
Yes
(d&(c&(b&a)))
Yes
(d&(c&b))
Yes
(d&(c&a))
Yes
(d&(c&(a|(b&T))))
Yes
(d&c)
Yes
(d&(b&a))
Yes
(d&((b&a)|(c&b)))
Yes
(d&((b&a)|(c&a)))
Yes
(d&((b&a)|(c&(a|(b&T)))))
Yes
(d&((b&a)|(c&T)))
Yes
(d&b)
Yes
(d&(b|(c&a)))
Yes
(d&(b|(c&T)))
Yes
(d&a)
Yes
(d&(a|(c&b)))
Yes
(d&(a|(c&T)))
Yes
(d&(a|(b&T...

result:

ok 168 lines, tightest: 11 out of 18 (168 test cases)

Test #7:

score: 0

Accepted

time: 6ms

memory: 3584kb

input:

7581
5
00000000000000000000000000000000
5
00000000000000000000000000000001
5
00000000000000000000000000000011
5
00000000000000000000000000000101
5
00000000000000000000000000000111
5
00000000000000000000000000001111
5
00000000000000000000000000010001
5
00000000000000000000000000010011
5
0000000000000...

output:

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

result:

ok 7581 lines, tightest: 22 out of 26 (7581 test cases)

Test #8:

score: 0

Accepted

time: 6ms

memory: 3968kb

input:

14
1
01
2
0111
3
00010111
4
0001011101111111
5
00000001000101110001011101111111
6
0000000100010111000101110111111100010111011111110111111111111111
7
00000000000000010000000100010111000000010001011100010111011111110000000100010111000101110111111100010111011111110111111111111111
8
00000000000000010000...

output:

Yes
a
Yes
(a|(b&T))
Yes
((b&a)|(c&(a|(b&T))))
Yes
(((b&a)|(c&(a|(b&T))))|(d&((a|(b&T))|(c&T))))
Yes
(((c&(b&a))|(d&((b&a)|(c&(a|(b&T))))))|(e&(((b&a)|(c&(a|(b&T))))|(d&((a|(b&T))|(c&T))))))
Yes
((((a|b)&(c|d))&(e|f))|((((c&(b&a))|(d&((b&a)|(c&(a|(b&T))))))|(e&((b&a)|(d&c))))|(f&(((b&a)|(d&c))|(e&(((...

result:

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

Test #9:

score: -100

Time Limit Exceeded

input:

14
1
01
2
0001
3
00010111
4
0000000100010111
5
00000001000101110001011101111111
6
0000000000000001000000010001011100000001000101110001011101111111
7
00000000000000010000000100010111000000010001011100010111011111110000000100010111000101110111111100010111011111110111111111111111
8
00000000000000000000...