Im unable to understand the solution logic of codeforces div2 664 problem c. http://codeforces.net/contest/1395/problem/C
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 161 |
2 | maomao90 | 160 |
3 | awoo | 159 |
4 | atcoder_official | 157 |
5 | -is-this-fft- | 155 |
5 | nor | 155 |
5 | adamant | 155 |
8 | Um_nik | 152 |
8 | maroonrk | 152 |
10 | djm03178 | 146 |
Im unable to understand the solution logic of codeforces div2 664 problem c. http://codeforces.net/contest/1395/problem/C
Название |
---|
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