the problem is http://codeforces.com/contest/513/problem/C
the solution is http://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 | 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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
the problem is http://codeforces.com/contest/513/problem/C
the solution is http://codeforces.com/contest/513/submission/9761274
i wonder how this solution not TLE it is 1009*1009*6*6*6 which is TLE
Name |
---|
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.