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.
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/06/2026 21:45:04 (g2).
Desktop version, switch to mobile version.
Supported by
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