Codeforces #664 (Div. 2) C. Boboniu and Bit Operations（暴力）

C. Boboniu and Bit Operations （暴力）

time limit per test： 1 second memory limit per test：256 megabytes input：standard input output：standard output

Boboniu likes bit operations. He wants to play a game with you.

Boboniu gives you two sequences of non-negative integers $a_1,a_2,\dots ,a_n$ and $b_1,b_2,\dots ,b_m$.

For each $i(1\le i\le n)$, you’re asked to choose a $j(1\le j\le m)$ and let $ci=ai$ & $bj$, where & denotes the bitwise AND operation（按位与运算）. Note that you can pick the same $j$ for different i’s.

Find the minimum possible $c1|c2|\dots |cn$, where | denotes the bitwise OR operation（按位或运算）.

Input
The first line contains two integers $n$ and $m$ $(1\le n,m\le 200)$.

The next line contains $n$ integers $a_1,a_2,\dots ,a_n(0\le a_i<29)$.

The next line contains $m$ integers $b_1,b_2,\dots ,b_m(0\le b_i<29)$.

Output
Print one integer: the minimum possible $c_1|c_2|\dots |c_n$.

Examples
input

4 2
2 6 4 0
2 4

output

2

input

7 6
1 9 1 9 8 1 0
1 1 4 5 1 4

output

0

input

8 5
179 261 432 162 82 43 10 38
379 357 202 184 197

output

147

Note
For the first example, we have KaTeX parse error: Expected 'EOF', got '&' at position 6: c1=a1&̲b2=0, c2=a2&b1=…&$b1=0,c4=a4$&$b1=0$.Thus $c1|c2|c3|c4=2$, and this is the minimal answer we can get.

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define N 1024
int a[N], b[N], visit[N][N];

int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 1; i <= m; ++i)
        cin >> b[i];
    visit[0][0] = 1;
    for (int i = 1; i <= n;++i) 
    {
        for (int j = 1; j <= m;++j)
        {
            int c = a[i] & b[j];
            for (int k = 0; k < 512; ++k) 
            {
                if (visit[i - 1][k]) 
                    visit[i][k | c] = 1;
            }

        }
    }
    for (int i = 0; i < 512; ++i)
    {
        if (visit[n][i])
        {
            printf("%d",i);
            return 0;
        }
    }
    return 0;
}