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?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | cry | 142 |
Name |
---|
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.