QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#861759#9980. Boolean Function Reconstructionucup-team191#AC ✓584ms4096kbC++232.0kb2025-01-18 19:41:192025-01-18 19:41:25

Judging History

你现在查看的是最新测评结果

  • [2025-01-18 19:41:25]
  • 评测
  • 测评结果:AC
  • 用时:584ms
  • 内存:4096kb
  • [2025-01-18 19:41:19]
  • 提交

answer

#include <bits/stdc++.h>
#define X first
#define Y second
#define PB push_back
#define x first
#define y second
#define pb push_back
#define all(a) begin(a),end(a)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
using pii=pair<int,int>;

const int N = 1e5 + 500;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const char en='\n';
const ll LLINF=1ll<<60;

string f(string s,int off)
{
	//cout << s << endl;
	if (s.size()==2)
	{
		if (s == "01") return string(1,'a'+off);
		if (s == "??") return "?";
		if (s[0] == '0' || s[1] == '0') 
			return "F";
		return "T";
	}
	int cl=s.size();
	
	string s1=s.substr(0,cl/2),s2=s.substr(cl/2);
	
	for(int i = 0;i < (int)s1.size();i++) {
		if(s1[i] == s2[i] && s1[i] == '1') {
			s2[i] = '?'; 
		}
	}
	
	string re_s1 = f(s1, off - 1), re_s2 = f(s2, off - 1);
	
	if(re_s1 == "?" && re_s2 == "?") return "?";
	if((re_s1 == "T" || re_s1 == "?") && (re_s2 == "T" || re_s2 == "?")) return "T";
	if((re_s1 == "F" || re_s1 == "?") && (re_s2 == "F" || re_s2 == "?")) return "F";

	if(re_s2 == "F" || re_s2 == "?") return re_s1;
	if(re_s1 == "T" || re_s1 == "?") return re_s2;

	string re=string(1,'a'+off);	
	if (re_s2 != "T" && re_s2 != "?") re="("+re+"&"+re_s2+")";
	
	if (re_s1 != "F" && re_s1 != "?") re="("+re+"|"+re_s1+")";
	
	return re;
}

int t,n;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while (t--)
	{
		cin>>n;
		string s;
		cin>>s;
		
		if(false) {
			s.resize(1<<n);
			int x;
			cin>>x;
			for (int i=0;i<(1<<n);++i)
			{
				int wei=0;
				for (int j=0;j<n;++j) if ((i>>j)&1) wei+=j+1;
				if (wei>=x) s[i]='1';
				else s[i]='0';
			}
		} 
		bool ok=1;
		for (int b=0;b<n;++b) for (int i=0;i<(1<<n);++i) if ((i>>b)&1)
		{
			if (s[i^(1<<b)]=='1' && s[i]=='0') ok=0;
		}
		//cout<<n<<' '<<s<<endl;
		if (!ok)
		{
			cout<<"No\n";
			//cout<<flush;
			continue;
		}
		cout<<"Yes\n";
		//cout<<flush;
		string odg=f(s,n-1);
		cout<<odg<<en;
		//cout<<(odg.size()-1)/4<<en;
	}
}

这程序好像有点Bug,我给组数据试试?

詳細信息

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

result:

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

Test #2:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

4
1
00
1
10
1
01
1
11

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: 1ms
memory: 3584kb

input:

16
2
0000
2
1000
2
0100
2
1100
2
0010
2
1010
2
0110
2
1110
2
0001
2
1001
2
0101
2
1101
2
0011
2
1011
2
0111
2
1111

output:

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

result:

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

Test #4:

score: 0
Accepted
time: 0ms
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: 16ms
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: 8 out of 18 (65536 test cases)

Test #6:

score: 0
Accepted
time: 1ms
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
(d&(c&(b&a)))
Yes
(d&(c&b))
Yes
(d&(c&a))
Yes
(d&(c&(b|a)))
Yes
(d&c)
Yes
(d&(b&a))
Yes
(d&((c&b)|(b&a)))
Yes
(d&((c&a)|(b&a)))
Yes
(d&((c&(b|a))|(b&a)))
Yes
(d&(c|(b&a)))
Yes
(d&b)
Yes
(d&((c&a)|b))
Yes
(d&(c|b))
Yes
(d&a)
Yes
(d&((c&b)|a))
Yes
(d&(c|a))
Yes
(d&(b|a))
Yes
(d&(c|(b|a)))
Ye...

result:

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

Test #7:

score: 0
Accepted
time: 13ms
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
(e&(d&(c&(b&a))))
Yes
(e&(d&(c&b)))
Yes
(e&(d&(c&a)))
Yes
(e&(d&(c&(b|a))))
Yes
(e&(d&c))
Yes
(e&(d&(b&a)))
Yes
(e&(d&((c&b)|(b&a))))
Yes
(e&(d&((c&a)|(b&a))))
Yes
(e&(d&((c&(b|a))|(b&a))))
Yes
(e&(d&(c|(b&a))))
Yes
(e&(d&b))
Yes
(e&(d&((c&a)|b)))
Yes
(e&(d&(c|b)))
Yes
(e&(d&a))
Yes
(e&(d&...

result:

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

Test #8:

score: 0
Accepted
time: 2ms
memory: 3840kb

input:

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

output:

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

result:

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

Test #9:

score: 0
Accepted
time: 3ms
memory: 3840kb

input:

14
1
01
2
0001
3
00010111
4
0000000100010111
5
00000001000101110001011101111111
6
0000000000000001000000010001011100000001000101110001011101111111
7
00000000000000010000000100010111000000010001011100010111011111110000000100010111000101110111111100010111011111110111111111111111
8
00000000000000000000...

output:

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

result:

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

Test #10:

score: 0
Accepted
time: 3ms
memory: 3840kb

input:

14
1
00
2
0001
3
00000001
4
0000000100010111
5
00000000000000010000000100010111
6
0000000000000001000000010001011100000001000101110001011101111111
7
00000000000000000000000000000001000000000000000100000001000101110000000000000001000000010001011100000001000101110001011101111111
8
00000000000000000000...

output:

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

result:

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

Test #11:

score: 0
Accepted
time: 2ms
memory: 3840kb

input:

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

output:

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

result:

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

Test #12:

score: 0
Accepted
time: 2ms
memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

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

result:

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

Test #13:

score: 0
Accepted
time: 2ms
memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000100000000000000010000000100010111000000000000000000000000000000000000000...

output:

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

result:

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

Test #14:

score: 0
Accepted
time: 2ms
memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #15:

score: 0
Accepted
time: 1ms
memory: 3840kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #16:

score: 0
Accepted
time: 239ms
memory: 3584kb

input:

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

output:

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

result:

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

Test #17:

score: 0
Accepted
time: 479ms
memory: 3584kb

input:

65536
7
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
7
00000001000100010001000101110111000100010111011101110111011111110001000101110111011101110111111100010001011101110111011111111111
7
000000010001001100000001001101...

output:

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

result:

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

Test #18:

score: 0
Accepted
time: 235ms
memory: 3584kb

input:

16384
8
0000000000000000000000000000000000000000000000000000000000010001000000000000000000000000000100010000000000010001000100010011011100000000000000000000000000010001000000000001000100010001011101110000000000000001000100010011011100010001000101110011011101111111
8
000101010101011100010101011101110...

output:

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

result:

ok 16384 lines, tightest: 119 out of 138 (16384 test cases)

Test #19:

score: 0
Accepted
time: 115ms
memory: 3840kb

input:

4096
9
00000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000111000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000001000101110000000000000000000000010001011100000...

output:

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

result:

ok 4096 lines, tightest: 237 out of 266 (4096 test cases)

Test #20:

score: 0
Accepted
time: 55ms
memory: 3712kb

input:

1024
10
0000000000000000000000000000000100000000000000110000000000000011000000000000000100000000000000110000000000000011000000010000001100000000000000110000000000000011000000000000001100000011000001110000000000000011000000000000001100000011000001110000001100011111000000000000001100000000000000110000...

output:

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

result:

ok 1024 lines, tightest: 370 out of 522 (1024 test cases)

Test #21:

score: 0
Accepted
time: 26ms
memory: 3712kb

input:

256
11
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

ok 256 lines, tightest: 665 out of 1034 (256 test cases)

Test #22:

score: 0
Accepted
time: 13ms
memory: 3712kb

input:

64
12
000101011111111101111111111111110001011111111111011111111111111100010111111111110111111111111111000101111111111101111111111111110001010111111111011111111111111100010111111111110111111111111111000101111111111101111111111111110001011111111111111111111111111101111111111111111111111111111111011111...

output:

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

result:

ok 64 lines, tightest: 1266 out of 2058 (64 test cases)

Test #23:

score: 0
Accepted
time: 6ms
memory: 3712kb

input:

16
13
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011000000000000000000000000000000000011111111111111111111111111111100000000000000000000000000000000000000...

output:

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

result:

ok 16 lines, tightest: 1774 out of 4106 (16 test cases)

Test #24:

score: 0
Accepted
time: 3ms
memory: 3712kb

input:

4
14
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

ok 4 lines, tightest: 2231 out of 8202 (4 test cases)

Test #25:

score: 0
Accepted
time: 3ms
memory: 3840kb

input:

4
14
0000000000000000000000000000000000000000000000000001000100010101000000000000000101010101010101010001010101010101011101110111111100000000000000000000000000000001000000000000000000010101010101010000000100010001010101010101011101010101010101010111111111111111000000000000000000010101010101010000000...

output:

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

result:

ok 4 lines, tightest: 1539 out of 8202 (4 test cases)

Test #26:

score: 0
Accepted
time: 4ms
memory: 3840kb

input:

4
14
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

ok 4 lines, tightest: 3380 out of 8202 (4 test cases)

Test #27:

score: 0
Accepted
time: 2ms
memory: 3840kb

input:

4
14
0000000000000000000000000001001100000000000000110000000000110011000000000011001100000000001100110000000000110011000000000011001100000000001100110000000000110011000000000011001100000000001100110001001100111111001100111111111100110011111111110011001111111111000000000011001100000011001101110000000...

output:

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

result:

ok 4 lines, tightest: 1911 out of 8202 (4 test cases)

Test #28:

score: 0
Accepted
time: 3ms
memory: 3840kb

input:

4
14
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000001000000000000000000000000000000000000000...

output:

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

result:

ok 4 lines, tightest: 2370 out of 8202 (4 test cases)

Test #29:

score: 0
Accepted
time: 2ms
memory: 3840kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #30:

score: 0
Accepted
time: 2ms
memory: 3840kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #31:

score: 0
Accepted
time: 2ms
memory: 3840kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

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

result:

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

Test #32:

score: 0
Accepted
time: 2ms
memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000110000000000000000000000000000001100000000000000110000001100111111000000000000000000000000000000000000000...

output:

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

result:

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

Test #33:

score: 0
Accepted
time: 2ms
memory: 3840kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #34:

score: 0
Accepted
time: 3ms
memory: 3840kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001010100000000000000000000000001010101000000000000000000000000000000000000000...

output:

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

result:

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

Test #35:

score: 0
Accepted
time: 584ms
memory: 3712kb

input:

65536
7
00000000000000010000000100000101000000000001011100000101010111110000000100000001000001110001011100000101001101110011011111111111
7
00000000000000010000000000010111000000000000011100000001011111110000000100000001000000110011011100010101001101110011111111111111
7
000000000000000000000001000100...

output:

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

result:

ok 65536 lines, tightest: 60 out of 74 (65536 test cases)

Test #36:

score: 0
Accepted
time: 82ms
memory: 3712kb

input:

1024
10
0000000000000000000000000000000000000000000000000000000000000011000000000000000000000001000001110000000000000111000101010111011100000000000000000000000000000111000000010001011100010011000101110000000100000001000001110001011100000101011111110101111111111111000000000000000100000000000100010000...

output:

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

result:

ok 1024 lines, tightest: 322 out of 522 (1024 test cases)

Test #37:

score: 0
Accepted
time: 21ms
memory: 3712kb

input:

64
12
000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000001000101110000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000010000000100010101000101110111111100000000000000000000000000000001000000...

output:

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

result:

ok 64 lines, tightest: 1115 out of 2058 (64 test cases)

Test #38:

score: 0
Accepted
time: 18ms
memory: 3712kb

input:

64
12
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000...

output:

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

result:

ok 64 lines, tightest: 1121 out of 2058 (64 test cases)

Test #39:

score: 0
Accepted
time: 15ms
memory: 3712kb

input:

64
12
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000...

output:

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

result:

ok 64 lines, tightest: 833 out of 2058 (64 test cases)

Test #40:

score: 0
Accepted
time: 5ms
memory: 3840kb

input:

4
14
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000010111000000000000000000000000000000000000000...

output:

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

result:

ok 4 lines, tightest: 3964 out of 8202 (4 test cases)

Test #41:

score: 0
Accepted
time: 6ms
memory: 3840kb

input:

4
14
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000...

output:

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

result:

ok 4 lines, tightest: 3872 out of 8202 (4 test cases)

Test #42:

score: 0
Accepted
time: 2ms
memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000100000001000000000000000000000000000000000000000...

output:

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

result:

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

Test #43:

score: 0
Accepted
time: 4ms
memory: 4096kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Test #44:

score: 0
Accepted
time: 3ms
memory: 3968kb

input:

1
15
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

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

result:

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

Extra Test:

score: 0
Extra Test Passed