In the previous contest I submitted a solution which got accepted but right now it says "Time limit exceeded". When I try to resubmit it, it keeps failing test 5. Any ideas why it's not efficient enough?
In the previous contest I submitted a solution which got accepted but right now it says "Time limit exceeded". When I try to resubmit it, it keeps failing test 5. Any ideas why it's not efficient enough?
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
unordered_sets are slow. you shouldn't use them
std::find(begin, end)works in linear time, not constant time, it cannot exploit any internal structure of the container. Use container's methods.Should be easy to reproduce with a big local test.