QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#866496	#9980. Boolean Function Reconstruction	ucup-team2818^#	TL	3210ms	200004kb	C++14	3.2kb	2025-01-22 15:48:04	2025-01-22 15:48:13

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

memory: 9956kb

input:

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

output:

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

result:

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

Test #2:

score: 0

Accepted

time: 0ms

memory: 9956kb

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: 9832kb

input:

output:

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

result:

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

Test #4:

score: 0

Accepted

time: 0ms

memory: 9964kb

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

memory: 9968kb

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

memory: 9792kb

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

result:

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

Test #7:

score: 0

Accepted

time: 89ms

memory: 9828kb

input:

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

output:

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

result:

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

Test #8:

score: 0

Accepted

time: 1316ms

memory: 76256kb

input:

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

output:

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

result:

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

Test #9:

score: 0

Accepted

time: 1323ms

memory: 77144kb

input:

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

output:

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

result:

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

Test #10:

score: 0

Accepted

time: 1325ms

memory: 79080kb

input:

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

output:

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

result:

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

Test #11:

score: 0

Accepted

time: 1308ms

memory: 74492kb

input:

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

output:

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

result:

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

Test #12:

score: 0

Accepted

time: 3061ms

memory: 199976kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

Yes
((((((((h&(i&(j&(k&(l&(m&(n&o)))))))|(g&((i&(j&(k&(l&(m&(n&o))))))|(h&((j&(k&(l&(m&(n&o)))))|(i&((k&(l&(m&(n&o))))|(j&((l&(m&(n&o)))|(k&((m&(n&o))|(l&((n&o)|(m&(o|n)))))))))))))))|(f&(((i&(j&(k&(l&(m&(n&o))))))|(h&((j&(k&(l&(m&(n&o)))))|(i&((k&(l&(m&(n&o))))|(j&((l&(m&(n&o)))|(k&((m&(n&o))|(l&((...

result:

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

Test #13:

score: 0

Accepted

time: 3030ms

memory: 199928kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000100000000000000010000000100010111000000000000000000000000000000000000000...

output:

Yes
(((((((((i&(j&(k&(l&(m&(n&o))))))|(h&((j&(k&(l&(m&(n&o)))))|(i&((k&(l&(m&(n&o))))|(j&((l&(m&(n&o)))|(k&((m&(n&o))|(l&((n&o)|(m&(o|n)))))))))))))|(g&(((j&(k&(l&(m&(n&o)))))|(i&((k&(l&(m&(n&o))))|(j&((l&(m&(n&o)))|(k&((m&(n&o))|(l&((n&o)|(m&(o|n)))))))))))|(h&(((k&(l&(m&(n&o))))|(j&((l&(m&(n&o)))|...

result:

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

Test #14:

score: 0

Accepted

time: 3049ms

memory: 200004kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

Yes
(((((((g&(h&(i&(j&(k&(l&(m&(n&o))))))))|(f&((h&(i&(j&(k&(l&(m&(n&o)))))))|(g&((i&(j&(k&(l&(m&(n&o))))))|(h&((j&(k&(l&(m&(n&o)))))|(i&((k&(l&(m&(n&o))))|(j&((l&(m&(n&o)))|(k&((m&(n&o))|(l&((n&o)|(m&(o|n)))))))))))))))))|(e&(((h&(i&(j&(k&(l&(m&(n&o)))))))|(g&((i&(j&(k&(l&(m&(n&o))))))|(h&((j&(k&(l...

result:

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

Test #15:

score: 0

Accepted

time: 2974ms

memory: 199976kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

Yes
((((((f&(g&(h&(i&(j&(k&(l&(m&(n&o)))))))))|(e&((g&(h&(i&(j&(k&(l&(m&(n&o))))))))|(f&((h&(i&(j&(k&(l&(m&(n&o)))))))|(g&((i&(j&(k&(l&(m&(n&o))))))|(h&((j&(k&(l&(m&(n&o)))))|(i&((k&(l&(m&(n&o))))|(j&((l&(m&(n&o)))|(k&((m&(n&o))|(l&((n&o)|(m&(o|n)))))))))))))))))))|(d&(((g&(h&(i&(j&(k&(l&(m&(n&o))))...

result:

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

Test #16:

score: 0

Accepted

time: 3210ms

memory: 9836kb

input:

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

output:

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

result:

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

Test #17:

score: -100

Time Limit Exceeded

input:

65536
7
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
7
00000001000100010001000101110111000100010111011101110111011111110001000101110111011101110111111100010001011101110111011111111111
7
000000010001001100000001001101...

output:

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