I want to know how can we do this in 3 steps. Given 1 2 3 4 5 6 7 8, we need to reach this 2 1 4 3 6 5 8 7, doing a riffle/dovetail shuffle on this each time. Any leads ? This is a test case for the problem H.
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
I want to know how can we do this in 3 steps. Given 1 2 3 4 5 6 7 8, we need to reach this 2 1 4 3 6 5 8 7, doing a riffle/dovetail shuffle on this each time. Any leads ? This is a test case for the problem H.
I was trying to solve FIRESC using http://www.codechef.com/viewsolution/3708062. Have used dfs implemented using stack in python and sys.stdin.readlines(). Yet, it is slow. Can someone suggest me if there is a faster way ? as here N=10^5, and it becomes slow for that.
I am just curious that how do the problem setters create the strong test cases for problems, say which involve strings of size 10^6. I dont think they type a string of length 10^6. Can anyone enlighten my mind on this ?
Название |
---|