the problem is http://mirror.codeforces.com/contest/513/problem/C
the solution is http://mirror.codeforces.com/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://mirror.codeforces.com/contest/513/problem/C
the solution is http://mirror.codeforces.com/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 | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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.