QOJ.ac

QOJ

The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#871081	#9980. Boolean Function Reconstruction	carrotqq	WA	12ms	8144kb	C++14	1.5kb	2025-01-25 19:24:15	2025-01-25 19:24: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: 7960kb

input:

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

output:

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

result:

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

Test #2:

score: 0

Accepted

time: 0ms

memory: 8020kb

input:

output:

Yes
F
No
Yes
(a&T)
Yes
T

result:

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

Test #3:

score: 0

Accepted

time: 0ms

memory: 6092kb

input:

output:

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

result:

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

Test #4:

score: 0

Accepted

time: 0ms

memory: 5964kb

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

Test #5:

score: 0

Accepted

time: 6ms

memory: 5944kb

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

Test #6:

score: 0

Accepted

time: 0ms

memory: 6096kb

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

result:

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

Test #7:

score: -100

Wrong Answer

time: 12ms

memory: 8144kb

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

result:

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