i submitted a solution to this question, but i cant understand why i am getting error. here's my code: http://codeforces.me/contest/598/submission/14241094 any help will be appreciated.
i submitted a solution to this question, but i cant understand why i am getting error. here's my code: http://codeforces.me/contest/598/submission/14241094 any help will be appreciated.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 144 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
| Название |
|---|



would be much better if u just placed a submition :/ this is ugly i dont think any body can read :)
my submission id is #14241094. how can i place a submit here?
chose submition item from the bar
also give me a good reason why it shouldnt get tl :)
think the querries are all like this
l = 1 , r = n , k = n — 1
|s| <= 10 000; m <= 300
i think it's n ^ 2 * m coz i think getting a substr is o(n) right ? then it would be m * (k % n) * o(n) = o(m * n2 )
my solution passed 14 test cases and is getting timed out in test case #15. i think i have taken the constraints in consideration.
instead of changing the string one by one do this : take the last k elements and put it at the front and then the others after it it would be O(nm)
can you please give me a pseudo code. am unable to comprehend your statement
sure !
14229742
thanks man!
yw