CCF2016.4 - B题

思路：创建两个bool数组来模拟下落过程，一个存放面板状态，一个存放下落的格子。检测格子和面板对应位置是否同时为True，如果是则有冲突，不能继续下落，否则增加行号。为了统一处理，我们把面板最下面加一行True。

 import java.util.*;
 public class Main {
     static boolean[][] board = new boolean[20][20];
     static boolean[][] block = new boolean[4][4];
     public static void main(String[] args) {
         Scanner cin = new Scanner(System.in);
         for (int i = 0; i < 15; i++)
             for (int j = 0; j < 10; j++)
                 board[i][j] = cin.nextInt() == 1;
         for (int i = 0; i < 10; i++)
             board[15][i] = true;
         for (int i = 0; i < 4; i++)
             for (int j = 0; j < 4; j++)
                 block[i][j] = cin.nextInt() == 1;
         int c = cin.nextInt(), r = 0;
         c--;
         while (check(r + 1, c))
             r++;
         for (int i = 0; i < 4; i++)
             for (int j = 0; j < 4; j++)
                 if (block[i][j])
                     board[r + i][c + j] = true;
         for (int i = 0; i < 15; i++) {
             for (int j = 0; j < 9; j++)
                 System.out.print((board[i][j] ? 1 : 0) + " ");
             System.out.println(board[i][9] ? 1 : 0);
         }
     }
     static boolean check(int r, int c) {
         for (int i = 0; i < 4; i++)
             for (int j = 0; j < 4; j++)
                 if (board[r + i][c + j] && block[i][j])
                     return false;
         return true;
     }
 }