"initialInput": {
This is the same idea behind binary search. In a sorted array, you compare against the middle element and eliminate half the remaining candidates. In a quadtree, you choose one of four quadrants and ignore the other three regions. Each level narrows the search space by a factor of four instead of two.
，这一点在Line官方版本下载中也有详细论述
Фото: Christian Charisius / Pool / Reuters，更多细节参见快连下载安装
Фонбет Чемпионат КХЛ。heLLoword翻译官方下载对此有专业解读