QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#866562	#9980. Boolean Function Reconstruction	ucup-team3479^#	WA	95ms	3968kb	C++20	5.0kb	2025-01-22 16:12:47	2025-01-22 16:12:53

Due to the privacy settings of the submitter, you are not allowed to view this code.

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3712kb

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

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

result:

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

Test #7:

score: 0

Accepted

time: 7ms

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

result:

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

Test #8:

score: 0

Accepted

time: 3ms

memory: 3840kb

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

result:

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

Test #9:

score: 0

Accepted

time: 2ms

memory: 3968kb

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

result:

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

Test #10:

score: 0

Accepted

time: 3ms

memory: 3712kb

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

result:

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

Test #11:

score: 0

Accepted

time: 1ms

memory: 3712kb

input:

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

output:

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

result:

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

Test #12:

score: 0

Accepted

time: 3ms

memory: 3712kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

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

result:

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

Test #13:

score: 0

Accepted

time: 1ms

memory: 3712kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000100000000000000010000000100010111000000000000000000000000000000000000000...

output:

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

result:

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

Test #14:

score: 0

Accepted

time: 3ms

memory: 3840kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #15:

score: 0

Accepted

time: 3ms

memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #16:

score: -100

Wrong Answer

time: 95ms

memory: 3712kb

input:

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

output:

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

result:

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