Hi Guys,I will always stuck at this type of problems.Here are some problems that involves domino tiling.
Problem1
Problem2
I found some tutorials on stackoverflow and on google search but I am unable to get it.
Is there any method to solve recurrence for this type of problem or some resources to learn will be helpful :)
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 157 |
| 5 | nor | 153 |
| 6 | maroonrk | 152 |
| 6 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/17/2024 13:35:15 (h1).
Desktop version, switch to mobile version.
Supported by
This is a classic problem of dynamic programming with bit masks.
The first problem you are trying to fill a 4xN board, this can be done iterating over columns, notice that if you are going to fill column K, you need to know the state of column K-1, K-1 may be full or may have some holes, for each hole you need to place an horizontal domino in column K, the trick is to have a bitmask representation for the state of column K-1 and iterate over all possible valid bitmasks for column K.
In the second problem N*M <= 100, this means than min(N, M) <= 10, this allows you to use the same approach as before.