Im unable to understand the solution logic of codeforces div2 664 problem c. http://codeforces.net/contest/1395/problem/C
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Im unable to understand the solution logic of codeforces div2 664 problem c. http://codeforces.net/contest/1395/problem/C
Name |
---|
Brute force the solution since 2^9 = 512. Test every a & b with each of these numbers to see if they match with the number, and pick the smallest of these numbers.
Let us take this as an example: $$$ n = 4 , m = 2$$$
$$$a = [2 , 6 , 4 , 0]$$$
$$$b = [2, 4]$$$
let us build all possible $$$&$$$ using two for loops.
this will create a 2D $$$4 \times 2$$$ table:
Now let us rephrase the problem, you need to pick exactly $$$1$$$ element from each row and make the operation $$$or$$$ between them. Find the minimum $$$or$$$ value.
Here where the dp comes in. since the constraints are low, the problem is doable using DP. where the states of the dp are: curRow, curCol, curOrValue
Hope that will help you!
Anyone can help how this problem can be done by DP?
see here