I am doing this problem. Can someone please tell me why i am getting tle verdict. My submission is in python. My submission : https://codeforces.com/contest/1283/submission/88064624
I am doing this problem. Can someone please tell me why i am getting tle verdict. My submission is in python. My submission : https://codeforces.com/contest/1283/submission/88064624
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3640 |
| 2 | Benq | 3593 |
| 3 | tourist | 3572 |
| 4 | orzdevinwang | 3561 |
| 5 | cnnfls_csy | 3539 |
| 6 | ecnerwala | 3534 |
| 7 | Radewoosh | 3532 |
| 8 | gyh20 | 3447 |
| 9 | Rebelz | 3409 |
| 10 | Geothermal | 3408 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Removing from index $$$i$$$ of a list should be $$$O(n - i)$$$, so repeatedly removing from the beginning — middle of the list will cause TLE.
I was removing the elements from a set. Shouldn't it be O(1) operation. And in the last part,i am popping the element from the list treating it like a double ended queue.So it should also take O(1) time.
Am i missing something?
I think popping the last element is $$$O(1)$$$, but popping the first is $$$O(n)$$$: https://stackoverflow.com/questions/195625/what-is-the-time-complexity-of-popping-elements-from-list-in-python/46136638#:~:text=Yes%2C%20it%20is%20O(1,list%20has%20to%20be%20shifted).&text=With%20an%20argument%20to%20pop,case%20time%20complexity%20O(k)
Use a deque to do both operations in $$$O(1)$$$.