PAST2O

from Second Algorithm Practical Skills Test PAST2O - The problem of finding the minimum area tree with a fixed number of edges to include.

• I think I can fix the edges if it's in the crassical direction.
• O(ElogE) is not a problem, since the sides are held back by 10^5.
• not match the correct (answer, etc.)
  • Not in time because we want the whole area tree for each side.

This page is auto-translated from /nishio/PAST2O 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.