如何快速可以玩俄罗斯方块greetion与矩形件?
How Fast Can We Play Tetris Greedily With Rectangular Pieces?
摘要:
考虑一个在宽$w$和无限高的棋盘上玩的俄罗斯方块的变体,其中棋子是任意整数维的轴对齐矩形,棋子只能在让它们落下之前移动,并且一行一旦满了就不会消失。假设我们想遵循一个贪婪策略:让每个矩形落在给定棋盘当前状态的最低点。要做到这一点,我们需要一个数据结构,它总是可以建议一个贪婪的举动。换句话说,我们需要一个数据结构,它维护一组$O(n)$矩形,支持返回在哪里放置矩形的查询,以及插入在某个位置放置的矩形并返回更新的矩形组中最高点的高度的更新。我们通过对多相问题的简化[Pintrachecu,2010]表明,在宽度为$w=Θ(n)$的板上,如果OMv猜想[Henzinger等人,2015]为真,则在时间上不能同时支持这两个操作$O(n^{1/2-ε})$。该约简还暗示了3-SUM猜想和APSP猜想的多项式界。另一方面,我们表明,有一个数据结构,支持这两个操作在$O(n^{1/2}\log^{3/2}n)$时间上的宽度$n^{O(1)}$板,匹配的下限到一个$n^{o(1)}$因素。
英文摘要:
Consider a variant of Tetris played on a board of width $w$ and infinite height, where the pieces are axis-aligned rectangles of arbitrary integer dimensions, the pieces can only be moved before letting them drop, and a row does not disappear once it is full. Suppose we want to follow a greedy strategy: let each rectangle fall where it will end up the lowest given the current state of the board. To do so, we want a data structure which can always suggest a greedy move. In other words, we want a data structure which maintains a set of $O(n)$ rectangles, supports queries which return where to drop the rectangle, and updates which insert a rectangle dropped at a certain position and return the height of the highest point in the updated set of rectangles. We show via a reduction to the Multiphase problem [Pătraşcu, 2010] that on a board of width $w=Θ(n)$, if the OMv conjecture [Henzinger et al., 2015] is true, then both operations cannot be supported in time $O(n^{1/2-ε})$ simultaneously. The reduction also implies polynomial bounds from the 3-SUM conjecture and the APSP conjecture. On the other hand, we show that there is a data structure supporting both operations in $O(n^{1/2}\log^{3/2}n)$ time on boards of width $n^{O(1)}$, matching the lower bound up to a $n^{o(1)}$ factor.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。