| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 154 |
| 6 | nor | 153 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Good day everyone,
Today I was solving 731C - Socks and I was getting TLE on test 32.
I really have no idea what is causing the TLE can somebody please help me ?
Note: that in my submission my code gave an answer but still it was counted as TLE.
My submission: 22259984.
Thank you for reading.
:)
Use a map to store count instead of an array . That's what causes tle .
Shouldn't maps have a log(n) complexity to access a value and shouldn't the array's complexity be (1) ?
memset(countt, 0, sizeof(countt));works in O(n). Try to use map for counting and clear it after each dfs.Ahhh so that's why...thank you guys so much you are awesome.
:)