please help why TLE,
is there any logical error or something else??
Combinations-I submission
Combinations-II submission
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
3 | adamant | 156 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
7 | maroonrk | 153 |
7 | cry | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
please help why TLE,
is there any logical error or something else??
Combinations-I submission
Combinations-II submission
Problem Link — Domino-and-tromino-tiling-problem
In this edutorial there is two problem.
part-1) Some tiling problems (I understand this completely)
part-2) A more complicated tiling problem (I have doubt in this)
the recurrence relation is f(n) = f(n-1) + f(n-2) + 2g(n-2)
I have doubt in function g(n) → (covering n*2 grid using L-shaped tile) is the recurrence reletion (g(n-2) part explain little bit) is correct.
I got some explanation for this question but i have some doubt; please Help!!!
- The **Dp formula** for this question is this dp[n]=dp[n-1]+dp[n-2]+ 2*(dp[n-3]+…+d[0]) - according to my understanding the dp[n-1] and dp[n-2] is due to domino - and the 2*(dp[n-3]+…+d[0]) is due to tromino - can someone explain why the total number of tiling for the trominos is 2*(dp[n-3]+…+d[0]);
or if my understanding about Dp formula is wrong please correct me!!
please help!!!
Название |
---|