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
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.04.2024 17:21:22 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
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)$$$.