| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
Following are my two C++ submissions for today`s contest AIM Tech Round 5 problem C,
Both are exactly same except an extra semicolon.
The solution is of O(NlogN) time complexity. Although my submissions were after the contest, but its highly likely that some users may have faced the similar issue during the contest, which is unfortunate.
I guess it is because servers fluctuation. There is a same problem.
Also, try to use
ios_base::sync_with_stdio(false);cin.tie(0);next time.Yeah thanks! It works pretty fast that way. But maybe time limits or constraints for such problems should be adjusted so that either most of O(NLogN) pass or most of them fail.
For example, time limit was 3 seconds for a very similar problem (with similar constraints) Maximal Intersection of round 506, which allows most O(NLogN) solutions to pass.