→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
16:56:54
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
16:56:54
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/23/2024 00:38:08 (h1).
Desktop version, switch to mobile version.
Supported by
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/