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
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 151 |
→ Find user
→ Recent actions
code for decomposing a permutation into a product of transpositions
Revision en3, by Hot_Potato, 2020-09-01 20:28:55
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: Dec/23/2024 08:21:08 (k3).
Desktop version, switch to mobile version.
Supported by
