I was solving Labyrinth from cses. My submission was Submission, I got a wrong answer on this submssion, but I think this solution works. Please Tell me what is wrong in my solution.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I was solving Labyrinth from cses. My submission was Submission, I got a wrong answer on this submssion, but I think this solution works. Please Tell me what is wrong in my solution.
After two years I finally reached pupil on Codeforces.
I use Visual Studio Code with CPH and Thorium browser. I am just curious about what tools do you use to do competitive programming.
In the problem Swaps [problem:https://codeforces.com/problemset/problem/1573/B], my solution which is of O(n log n) time complexity is not working and giving a tle on test 2, when clearly the problem allows O(n log n) to pass. My solution: [submission:https://codeforces.com/contest/1573/submission/240104987]. Can somebody explain why this is happening. I know that there is a better solution in the editorial but why should this not pass?
Update: Fixed the problem :>
Name |
---|