201512-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 LL LNF = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 30 + 5;
const int mod = 1e9 + 7;
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
const char *Hex[] = {"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[maxn][maxn];
int ans[maxn][maxn];

int main(){
    while(scanf("%d %d", &n, &m) == 2){
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
                scanf("%d", &a[i][j]);
        memcpy(ans, a, sizeof a);
        for(int i = 0; i < n; ++i){
            int cnt = 1;
            for(int j = 1; j < m; ++j){
                if(a[i][j] == a[i][j-1])  ++cnt;
                else{
                    if(cnt > 2){
                        for(int k = j-1; k >= j-cnt; --k)
                            ans[i][k] = 0;
                    }
                    cnt = 1;
                }
                if(j == m-1 && cnt > 2)
                    for(int k = j; k > j-cnt; --k)
                            ans[i][k] = 0;
            }
        }

        for(int i = 0; i < m; ++i){
            int cnt = 1;
            for(int j = 1; j < n; ++j){
                if(a[j][i] == a[j-1][i])  ++cnt;
                else{
                    if(cnt > 2){
                        for(int k = j-1; k >= j-cnt; --k)
                            ans[k][i] = 0;
                    }
                    cnt = 1;
                }
                if(j == n-1 && cnt > 2)
                    for(int k = j; k > j-cnt; --k)
                            ans[k][i] = 0;
            }
        }
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
                if(j != m-1)  printf("%d ", ans[i][j]);
                else  printf("%d\n", ans[i][j]);
    }
    return 0;
}