https://pasteboard.co/JVs1DoO.png
Do you also see the issue here?
MikeMirzayanov do you have a time to take a look at this?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3904 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3494 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | maroonrk | 3350 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
6 | adamant | 157 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
https://pasteboard.co/JVs1DoO.png
Do you also see the issue here?
MikeMirzayanov do you have a time to take a look at this?
We have 2 sets — S and T in 3d space ( points from these sets are separed by hyperplane ).
We need to find closest pair of points ( one of which is from S, other one from T ).
There's an algorithm for 2d case when we have only 1 set of points. How do this solve this one though?
ЗКШ в Харькове — нужны тесты и авторские решения ко всем годам. Кто-то может с этим помочь?
Name |
---|