| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
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!