I was solving problem Metro in TimusOJ using DP but it get TLE verdict.How do i optimize my solution. My Solution in Ideone . Thanks Sorry for wrong link. UPD: Accepted, Thank you codeforces community :)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
I was solving problem Metro in TimusOJ using DP but it get TLE verdict.How do i optimize my solution. My Solution in Ideone . Thanks Sorry for wrong link. UPD: Accepted, Thank you codeforces community :)
Name |
---|
Update the link of IdeOne, it was directing to Timus.
Try to use normal 2D array instead of this
map< pair< int, int >, int >
shitFirst of all no need to use map when matrix can be around 1000*1000. And the main problem is that you are using m({i,j}) > 0 instead of m.find({i,j}) != m.end(). This is causing the TLE. Before using stl, try to read its tutorial first. And ceil() will always give upper bound, try to use something like (ans + 0.5) or round() and print as integer.