QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#861951	#9980. Boolean Function Reconstruction	ucup-team3602^#	WA	373ms	4304kb	C++20	5.2kb	2025-01-18 20:48:56	2025-01-18 20:50:11

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

result:

ok 7 lines, tightest: 4 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: 3712kb

input:

output:

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

memory: 3584kb

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

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

result:

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

Test #7:

score: 0

Accepted

time: 13ms

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

result:

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

Test #8:

score: 0

Accepted

time: 3ms

memory: 4096kb

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

result:

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

Test #9:

score: 0

Accepted

time: 2ms

memory: 4096kb

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

result:

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

Test #10:

score: 0

Accepted

time: 2ms

memory: 4096kb

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

result:

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

Test #11:

score: 0

Accepted

time: 2ms

memory: 3968kb

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

result:

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

Test #12:

score: 0

Accepted

time: 3ms

memory: 4304kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

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

result:

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

Test #13:

score: 0

Accepted

time: 2ms

memory: 4092kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000100000000000000010000000100010111000000000000000000000000000000000000000...

output:

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

result:

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

Test #14:

score: 0

Accepted

time: 2ms

memory: 4172kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #15:

score: 0

Accepted

time: 2ms

memory: 4152kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #16:

score: 0

Accepted

time: 190ms

memory: 3712kb

input:

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

output:

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

result:

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

Test #17:

score: -100

Wrong Answer

time: 373ms

memory: 3840kb

input:

65536
7
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
7
00000001000100010001000101110111000100010111011101110111011111110001000101110111011101110111111100010001011101110111011111111111
7
000000010001001100000001001101...

output:

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

result:

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