| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | 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 | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
Given a set of n points and m transformations that are to be applied to each of the points, how can I perform the transformations in < O(nm)?
I tried to understand the solution to this from an article on e-maxx.ru/algo/binary_pow (its English translation), but I was unable to understand the method. Can someone help me out?
From linear algebra we know that a combination of transformations performed sequentially is a transformation itself. Moreover, if all transformations are represented by a matrix, the resulting transformation is represented by a product of our matrices. That's all.
But the best answer for your question will be: just take a book in linear algebra and study it!
Ok!