QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#860933	#9980. Boolean Function Reconstruction	ucup-team3727^#	WA	13ms	3712kb	C++20	3.7kb	2025-01-18 15:37:25	2025-01-18 15:37:57

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

input:

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

output:

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

result:

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

Test #2:

score: 0

Accepted

time: 1ms

memory: 3712kb

input:

output:

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

result:

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

Test #3:

score: 0

Accepted

time: 1ms

memory: 3584kb

input:

output:

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

result:

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

Test #4:

score: 0

Accepted

time: 1ms

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

Test #5:

score: 0

Accepted

time: 13ms

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

result:

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

Test #7:

score: -100

Wrong Answer

time: 8ms

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

result:

wrong answer 27 operations, you can't use more than 26 operations (test case 1350)