Question — https://codeforces.me/problemset/problem/161/D
Submission — https://codeforces.me/contest/161/submission/278555376
IMO, it should pass the time constraints. Am I missing something?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Question — https://codeforces.me/problemset/problem/161/D
Submission — https://codeforces.me/contest/161/submission/278555376
IMO, it should pass the time constraints. Am I missing something?
Name |
---|
try to use int array. not long vector
Buddy when you are calling dfs it's complexity is n*k*k... It should be n*k fir sol to work . Why are checking for all k values you only have to check for single k... Dp here is unnecessary
Sorry, there are many mistakes in my above answer. Misread the problem statement. I will try to answer in some time. Please ignore above statement.