the problem is http://codeforces.me/contest/513/problem/C
the solution is http://codeforces.me/contest/513/submission/9761274
i wonder how this solution not TLE it is 1009*1009*6*6*6 which is TLE
the problem is http://codeforces.me/contest/513/problem/C
the solution is http://codeforces.me/contest/513/submission/9761274
i wonder how this solution not TLE it is 1009*1009*6*6*6 which is TLE
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | 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 | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Dude. You don't just analyze the complexity by counting for loops
the each iteration in the for loop work as i clear the dp array so this is the complexity i am confused :s
For clearing the dp array, I see four for loops and they go till 6,6,6,10009 so how TLE?
no i mean the dp is in 10009*6*6*6 okay but there is for loop iterating on dp in the main so what is the total complexity ?
Memoization technique has been used in the solution, which means you just calculate the value for each state only once. Therefore the whole solution proceeds 10009*6*6*6 different states which is pretty far from TLE.