# | 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 | Vladosiya | 144 |
9 | nor | 144 |
Name |
---|
In 23-rd line you multiply ints up to 106. It will cause overflow. And be careful about number of digits in output.
I corrected the overflow situation but again I am getting segmentation fault. Could you please check it again? My new solution is here
You are running out of memory. Use vector instead of array with size 50k in line #99. Btw. it is not implemented optimally (complexity is with log^2 I think). I suggest you check out this algorithm with set. It is much simpler.
For example consider test where all points have the same x-coordinate. Then your program is
. It can be fixed but it's nothing fun.
I fixed the size of that array to n everytime. Got accepted now. Thanks bro.
simpler way to find closest pair: link
Similar solution with O(N log N) time https://www.geeksforgeeks.org/closest-pair-of-points-onlogn-implementation/