ARC092A
C - 2D Plane 2N Points
https://gyazo.com/8624dbe1a26b4a3709830321e704326f
Thoughts.
Bipartite graph of 200 at the highest, 10^4 even if you use the edges naively, what's the difficulty?
Oh, is it generally difficult to solve maximum bipartite matching by attributing it to maximum flow?
Official Explanation
The above solution is mentioned as an "afterthought."
The assumed solution is O(N) by finding a means to determine Greedy
ARC092
---
This page is auto-translated from /nishio/ARC092A using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.