QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#860767	#9980. Boolean Function Reconstruction	ucup-team3966^#	WA	285ms	4224kb	C++14	1.0kb	2025-01-18 14:52:44	2025-01-18 14:56:21

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

result:

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

Test #2:

score: 0

Accepted

time: 0ms

memory: 3712kb

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
(b|a)
Yes
T

result:

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

Test #5:

score: 0

Accepted

time: 30ms

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

result:

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

Test #7:

score: 0

Accepted

time: 8ms

memory: 3712kb

input:

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

output:

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

result:

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

Test #8:

score: 0

Accepted

time: 4ms

memory: 4096kb

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

result:

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

Test #9:

score: 0

Accepted

time: 3ms

memory: 4096kb

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

result:

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

Test #10:

score: 0

Accepted

time: 1ms

memory: 3968kb

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

result:

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

Test #11:

score: 0

Accepted

time: 3ms

memory: 4096kb

input:

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

output:

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

result:

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

Test #12:

score: 0

Accepted

time: 4ms

memory: 4224kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

Yes
((((((((b&(l&(o&(h&(a&(c&(i&n)))))))|(j&((l&(o&(h&(a&(c&(i&n))))))|(b&((o&(h&(a&(c&(i&n)))))|(l&((h&(a&(c&(i&n))))|(o&((a&(c&(i&n)))|(h&((c&(i&n))|(a&((i&n)|(c&(i|n)))))))))))))))|(k&(((l&(o&(h&(a&(c&(i&n))))))|(b&((o&(h&(a&(c&(i&n)))))|(l&((h&(a&(c&(i&n))))|(o&((a&(c&(i&n)))|(h&((c&(i&n))|(a&((...

result:

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

Test #13:

score: 0

Accepted

time: 2ms

memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000100000000000000010000000100010111000000000000000000000000000000000000000...

output:

Yes
(((((((((l&(o&(h&(a&(c&(i&n))))))|(b&((o&(h&(a&(c&(i&n)))))|(l&((h&(a&(c&(i&n))))|(o&((a&(c&(i&n)))|(h&((c&(i&n))|(a&((i&n)|(c&(i|n)))))))))))))|(j&(((o&(h&(a&(c&(i&n)))))|(l&((h&(a&(c&(i&n))))|(o&((a&(c&(i&n)))|(h&((c&(i&n))|(a&((i&n)|(c&(i|n)))))))))))|(b&(((h&(a&(c&(i&n))))|(o&((a&(c&(i&n)))|...

result:

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

Test #14:

score: 0

Accepted

time: 3ms

memory: 4224kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

Yes
(((((((j&(b&(l&(o&(h&(a&(c&(i&n))))))))|(k&((b&(l&(o&(h&(a&(c&(i&n)))))))|(j&((l&(o&(h&(a&(c&(i&n))))))|(b&((o&(h&(a&(c&(i&n)))))|(l&((h&(a&(c&(i&n))))|(o&((a&(c&(i&n)))|(h&((c&(i&n))|(a&((i&n)|(c&(i|n)))))))))))))))))|(e&(((b&(l&(o&(h&(a&(c&(i&n)))))))|(j&((l&(o&(h&(a&(c&(i&n))))))|(b&((o&(h&(a...

result:

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

Test #15:

score: 0

Accepted

time: 2ms

memory: 4224kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #16:

score: 0

Accepted

time: 143ms

memory: 3712kb

input:

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

output:

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

result:

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

Test #17:

score: -100

Wrong Answer

time: 285ms

memory: 3840kb

input:

65536
7
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
7
00000001000100010001000101110111000100010111011101110111011111110001000101110111011101110111111100010001011101110111011111111111
7
000000010001001100000001001101...

output:

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

result:

wrong answer 75 operations, you can't use more than 74 operations (test case 398)