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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
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
Название |
---|
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.