question link : https://codeforces.com/problemset/problem/1256/B solution link : https://ideone.com/JInG1y What is the problem in this anyone?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
question link : https://codeforces.com/problemset/problem/1256/B solution link : https://ideone.com/JInG1y What is the problem in this anyone?
Name |
---|
could you elaborate on how your code is supposed to work ??
start from 1 if in correct position continue otherwise found its position and while its not in its correct position and swap is possible i keep on swapping.
more specifically what is the map <ll, ll> h doing ??
nevermind this
consider the test case: 1 8 8 5 6 7 1 3 2 4
you code gives: 1 8 5 6 2 7 4 3
ans 1 8 5 6 2 7 3 4
Your code is swapping them before assigning right cnt,
swap(a[e],a[e-1]);
cnt[a[e]]=e-1;
cnt[a[e-1]]=e;
First update then swapcnt[a[e]]=e-1;cnt[a[e-1]]=e;swap(a[e],a[e-1]);
then second thing if say a[e] is 4 and a[e-1] is 3, then you should not swap... eg take this case: n=8, arr=[8 5 6 7 1 3 2 4] after some steps it becomes 1 8 5 6 2 7 3 4, we cannot swap 3 with 7 as that operation is already used, then your code is swapping 4 with 3, hence it gives 1 8 5 6 2 7 4 3. add a conditionwhile(e>i && a[e-1]>a[e] && h.count(e-1)==0)