Given a list of strings lst and a list of integers p, reorder lst so that every lst[i] gets placed to p[i]. I am trying to solve this by decomposing permutation p into a product of transposition(swaps) and then use those swaps to reorder lst.. can anyone give me the code for decomposing a permutation into a product of transpositions?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 7 | cnnfls_csy | 3569 |
| 9 | ecnerwala | 3494 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 4 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | maroonrk | 152 |
→ Find user
→ Recent actions
code for decomposition a permutation into a product of transpositions
Revision en1, by Hot_Potato, 2020-09-01 20:25:48
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
Hot_Potato | 2020-09-01 20:58:24 | 191 | (published) | |
| en4 |
|
Hot_Potato | 2020-09-01 20:56:54 | 63 | (saved to drafts) | |
| en3 |
|
Hot_Potato | 2020-09-01 20:28:55 | 0 | (published) | |
| en2 |
|
Hot_Potato | 2020-09-01 20:27:23 | 4 | (saved to drafts) | |
| en1 |
|
Hot_Potato | 2020-09-01 20:25:48 | 406 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/01/2024 12:34:56 (i1).
Desktop version, switch to mobile version.
Supported by
