can anyone suggest approach to solve this problem?
https://codeforces.com/gym/102157/problem/3
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
can anyone suggest approach to solve this problem?
https://codeforces.com/gym/102157/problem/3
Name |
---|
I think for this problem you're DP state is going to be DP[current index on first row][what elements are matched on bottom row]
We can use a bitmask to represent what elements are matched on the bottom row (with respect to our current index on the first row). Because e <= 4, the we only need to consider "windows" of length 9, so our bit mask goes to 2^9 which is 512. Transitions then become trivial.
I believe the overall complexity is O(N * 2^(2E+1) + N*K).
Thank you...
Can you please elaborate. Can you provide recurrence relation?