I've written the solution for 543 B,I think it works fine but gets time limit on test 8.I ckecked and it doesn't pass inputing phase.How can it happen with 3000 numbers?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
Auto comment: topic has been updated by luka25 (previous revision, new revision, compare).
Auto comment: topic has been updated by luka25 (previous revision, new revision, compare).
Use faster I/O. You can either use
ios_base::sync_with_stdio(0);cin.tie(0);at the beginning of your program and continue using cin/cout or use scanf/printf.will it help on 3000 numbers?
If the problem with your code is not the algorithm, it should make a significant difference. Input with these techniques can be more than 5 times faster.
special for you fixed code .
research BFS implementation. for example
thanks very much,so was the problem in implementation of bfs?when i checked it failed during imputing and didn't even reach bfs part
i didn't consider map is logN just changing to unordered_map fixed it.
Your code awesome beautiful!!! Are you understand why std::map — TLE, std::unordered_set — AC ??
I used map instead of array because it can be cleared more easily, didn't think of it being too slow.