NHAY is a SPOJ question involving pattern search. The Link: http://www.spoj.com/problems/NHAY/
My solution gives me TLE. Here is my code: https://ideone.com/A2N6An What are some optimizations that I can apply on my code?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
NHAY is a SPOJ question involving pattern search. The Link: http://www.spoj.com/problems/NHAY/
My solution gives me TLE. Here is my code: https://ideone.com/A2N6An What are some optimizations that I can apply on my code?
Name |
---|
Auto comment: topic has been updated by coco_elon (previous revision, new revision, compare).
Auto comment: topic has been updated by coco_elon (previous revision, new revision, compare).
Every time you call strlen(), it works for O(len), so your code works for O(n^2).
And please, format your code. It's really hard to read it.
Thanks!
Doesn't Optimizer change the code to a way you said ? I thought c++ optimizer have such things that can detect unchanged values in loops and doesn't recalculate them every time for conditions.
Auto comment: topic has been updated by coco_elon (previous revision, new revision, compare).