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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 165 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
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).