QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#862392	#9980. Boolean Function Reconstruction	ucup-team3188^#	WA	43ms	3968kb	C++20	2.3kb	2025-01-19 00:38:56	2025-01-19 00:38:56

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

input:

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

output:

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

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

input:

output:

Yes
F
No
No
No
No
No
No
No
Yes
(a&b)
No
Yes
a
No
Yes
b
No
Yes
((b&T)|a)
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: 43ms

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:

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

Test #6:

score: 0

Accepted

time: 0ms

memory: 3584kb

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

result:

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

Test #7:

score: 0

Accepted

time: 19ms

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

result:

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

Test #8:

score: -100

Wrong Answer

time: 4ms

memory: 3968kb

input:

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

output:

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

result:

wrong answer 43 operations, you can't use more than 42 operations (test case 6)