how to solve this problem? I want to solve it but couldn't find any approach? no tutorial or source code is available. I spent enough time for it.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
how to solve this problem? I want to solve it but couldn't find any approach? no tutorial or source code is available. I spent enough time for it.
Name |
---|
Use bitmasks
Dear, is it anyhow possible using dp? (without bitmasks)
This is not possible without bitmask as you can not select the candies from the same cell twice(once while selecting its row and once while selection its column). So, you need to keep a track of which rows and columns you have already selected to prevent adding the same cell twice.