New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Closest pair of points #1

Open

mfornet opened this issue Apr 1, 2018 · 1 comment

Member

mfornet commented Apr 1, 2018

In the Closest pair of points algorithm we should recover closest pair.

Contributor

gilcu3 commented Apr 2, 2018

In a recent problem (brazil's Endagorion geometry contest I think) I saw that divide&conquer implementation is at least one order of magnitude faster, although a bit longer code, do you think it would be useful to use that algorithm instead?
http://codeforces.com/group/3qadGzUdR4/contest/101707/submission/34488424
http://codeforces.com/group/3qadGzUdR4/contest/101707/submission/34519736

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment