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.net/contest/1283/submission/88064624
→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
26:51:06
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
26:51:06
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/22/2024 14:43:54 (h1).
Desktop version, switch to mobile version.
Supported by
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)$$$.