CSSA's most handsome president Chang Cailou recently felt that riding motorcycles outdoors was too boring, so he developed a special Tetris game and would like you to help him test this game.
The special Tetris game screen has 10 rows and 15 columns. Every second, a block will fall until it reaches the bottom or rests on another stationary block.
When all cells in a row are filled with stationary blocks, that row will be eliminated, and all blocks above will move down one row.
The game lasts for T seconds, during which 1 to N blocks will be placed. Each block will be placed into the game at a designated time point M, consisting of a 3x3 grid with its top-left corner at coordinates (X, Y) and identified by block type P. All blocks are guaranteed to have sufficient space for placement without exceeding game boundaries.
The K-th placed block is labeled with its placement order number K, where 0 indicates no block at the current position. Output the game screen at the time the game ends.
There are six types of block:
This problem is a partial judge.
Please implement functions defined in the header file.
All classes that inherit from Tetrominoes
Scene
The first line contains three integers N, T, indicating N blocks will be placed during the game and the game lasts for T seconds.
The next N lines contain four integers Mi , Pi , Xi , Yi , indicating the i-th block will be placed at Mi seconds into the game, in a 3×3 grid with top-left corner at coordinates (Xi , Yi ) . Each placed block is guaranteed to have enough space for placement. The integer Pi indicates the block type.
The K-th placed block is labeled with its placement order number K, where 0 indicates no block at the current position. Output the game screen at the time the game ends.
Please remember to print "\n" at the end.