second MST O(n^2 * log(n))
triangle with minimum perimeter, sweep line O(NlogN)
peaceful atom, meet-in-the-middle O(N^(N/2) * log(N))
2-SAT problem
closest pair problem, sweepline O(NlogN)
tree2 from timus with dfs and set O(NlogN)
implicit segment tree