QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#862553	#9980. Boolean Function Reconstruction	ucup-team6072^#	TL	862ms	9984kb	Python3	1.9kb	2025-01-19 03:07:57	2025-01-19 03:07:59

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 10ms

memory: 8704kb

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: 0

Accepted

time: 6ms

memory: 8832kb

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: 11ms

memory: 8832kb

input:

output:

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

result:

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

Test #4:

score: 0

Accepted

time: 11ms

memory: 8832kb

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: 4 out of 14 (256 test cases)

Test #5:

score: 0

Accepted

time: 862ms

memory: 9600kb

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: 8 out of 18 (65536 test cases)

Test #6:

score: 0

Accepted

time: 12ms

memory: 8832kb

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)))
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))))
Yes
(d&((b&a)|c))
Yes
(d&b)
Yes
(d&(b|(c&a)))
Yes
(d&(b|c))
Yes
(d&a)
Yes
(d&(a|(c&b)))
Yes
(d&(a|c))
Yes
(d&(a|b))
Yes
(d&((a|b)|c))
Ye...

result:

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

Test #7:

score: 0

Accepted

time: 227ms

memory: 9984kb

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

result:

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

Test #8:

score: 0

Accepted

time: 71ms

memory: 9216kb

input:

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

output:

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

result:

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

Test #9:

score: 0

Accepted

time: 56ms

memory: 9088kb

input:

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

output:

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

result:

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

Test #10:

score: 0

Accepted

time: 53ms

memory: 9088kb

input:

14
1
00
2
0001
3
00000001
4
0000000100010111
5
00000000000000010000000100010111
6
0000000000000001000000010001011100000001000101110001011101111111
7
00000000000000000000000000000001000000000000000100000001000101110000000000000001000000010001011100000001000101110001011101111111
8
00000000000000000000...

output:

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

result:

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

Test #11:

score: 0

Accepted

time: 42ms

memory: 9048kb

input:

14
1
00
2
0000
3
00000001
4
0000000000000001
5
00000000000000010000000100010111
6
0000000000000000000000000000000100000000000000010000000100010111
7
00000000000000000000000000000001000000000000000100000001000101110000000000000001000000010001011100000001000101110001011101111111
8
00000000000000000000...

output:

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

result:

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

Test #12:

score: 0

Accepted

time: 69ms

memory: 9344kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

Yes
((((((((h&(g&(f&(e&(d&(c&(b&a)))))))|(i&((g&(f&(e&(d&(c&(b&a))))))|(h&((f&(e&(d&(c&(b&a)))))|(g&((e&(d&(c&(b&a))))|(f&((d&(c&(b&a)))|(e&((c&(b&a))|(d&((b&a)|(c&(a|b)))))))))))))))|(j&(((g&(f&(e&(d&(c&(b&a))))))|(h&((f&(e&(d&(c&(b&a)))))|(g&((e&(d&(c&(b&a))))|(f&((d&(c&(b&a)))|(e&((c&(b&a))|(d&((...

result:

ok 1 lines, tightest: 12868 out of 16394 (1 test case)

Test #13:

score: 0

Accepted

time: 89ms

memory: 9600kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000100000000000000010000000100010111000000000000000000000000000000000000000...

output:

Yes
(((((((((g&(f&(e&(d&(c&(b&a))))))|(h&((f&(e&(d&(c&(b&a)))))|(g&((e&(d&(c&(b&a))))|(f&((d&(c&(b&a)))|(e&((c&(b&a))|(d&((b&a)|(c&(a|b)))))))))))))|(i&(((f&(e&(d&(c&(b&a)))))|(g&((e&(d&(c&(b&a))))|(f&((d&(c&(b&a)))|(e&((c&(b&a))|(d&((b&a)|(c&(a|b)))))))))))|(h&(((e&(d&(c&(b&a))))|(f&((d&(c&(b&a)))|...

result:

ok 1 lines, tightest: 11438 out of 16394 (1 test case)

Test #14:

score: 0

Accepted

time: 52ms

memory: 9344kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

Yes
(((((((i&(h&(g&(f&(e&(d&(c&(b&a))))))))|(j&((h&(g&(f&(e&(d&(c&(b&a)))))))|(i&((g&(f&(e&(d&(c&(b&a))))))|(h&((f&(e&(d&(c&(b&a)))))|(g&((e&(d&(c&(b&a))))|(f&((d&(c&(b&a)))|(e&((c&(b&a))|(d&((b&a)|(c&(a|b)))))))))))))))))|(k&(((h&(g&(f&(e&(d&(c&(b&a)))))))|(i&((g&(f&(e&(d&(c&(b&a))))))|(h&((f&(e&(d...

result:

ok 1 lines, tightest: 11438 out of 16394 (1 test case)

Test #15:

score: 0

Accepted

time: 37ms

memory: 9472kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

Yes
((((((j&(i&(h&(g&(f&(e&(d&(c&(b&a)))))))))|(k&((i&(h&(g&(f&(e&(d&(c&(b&a))))))))|(j&((h&(g&(f&(e&(d&(c&(b&a)))))))|(i&((g&(f&(e&(d&(c&(b&a))))))|(h&((f&(e&(d&(c&(b&a)))))|(g&((e&(d&(c&(b&a))))|(f&((d&(c&(b&a)))|(e&((c&(b&a))|(d&((b&a)|(c&(a|b)))))))))))))))))))|(l&(((i&(h&(g&(f&(e&(d&(c&(b&a))))...

result:

ok 1 lines, tightest: 8006 out of 16394 (1 test case)

Test #16:

score: -100

Time Limit Exceeded

input:

65536
6
0000001101111111000111111111111101111111111111111111111111111111
6
0000000000000000000100110011011100000000000000000001001100111111
6
0101010101110111011101111111111101110111111111111111111111111111
6
0000001100000011000000110001011100011111001111110011111100111111
6
000000010001011100000001...

output:

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