CCF 201604-2 俄罗斯方块 (模拟)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std;

typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 1e3 + 5;
const int mod = 1e9 + 7;
const char *mark = "+-*";
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int Min(int a, int b){ return a < b ? a : b; }
inline int Max(int a, int b){ return a > b ? a : b; }
inline LL Min(LL a, LL b){ return a < b ? a : b; }
inline LL Max(LL a, LL b){ return a > b ? a : b; }
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}
int a[20][15];
int b[10][10];

int main(){
    for(int i = 1; i <= 15; ++i)
        for(int j = 1; j <= 10; ++j)
            scanf("%d", &a[i][j]);
    for(int i = 1; i < 5; ++i)
        for(int j = 1; j < 5; ++j)
            scanf("%d", &b[i][j]);
    scanf("%d", &n);

    int cnt = 5;
    while(true){
        bool ok = false;
        for(int i = cnt; i > cnt-4; --i){
            for(int j = n; j < n+4; ++j)
                if((a[i][j] && b[i-cnt+4][j-n+1]) || (i >= 16 && b[i-cnt+4][j-n+1])){ ok = true; break; }
            if(ok)  break;
        }

        if(ok)  break;
        ++cnt;
    }

    --cnt;
    for(int i = cnt; i > cnt-4; --i)
        for(int j = n; j < n+4; ++j)
            a[i][j] |= b[i-cnt+4][j-n+1];



    for(int i = 1; i < 16; ++i)
        for(int j = 1; j < 11; ++j)
            if(10 == j)  printf("%d\n", a[i][j]);
            else printf("%d ", a[i][j]);

    return 0;
}