消除类游戏

#include <bits/stdc++.h>
using namespace std;
int n, m;
const int maxn = 35;
int board[maxn][maxn];
struct Pos{
	int x, y;
	Pos(int xx, int yy): x(xx),y(yy) {}
};
vector<Pos> v;
int main(){
	memset(board,0,sizeof(board));
	scanf("%d%d", &n,&m);
	for(int i=0; i<n; ++i){
		for(int j=0; j<m; ++j){
			scanf("%d", &board[i][j]);
		}
	}
	for(int i=0; i<n; ++i){
		int color = board[i][0];
		int cnt = 1;
		for(int j=1; j<m; ++j){
			if(board[i][j] == color){
				cnt++;
				if(cnt>=3){
					v.push_back(Pos(i,j));
					if(cnt==3){
						v.push_back(Pos(i,j-1));
						v.push_back(Pos(i,j-2));
					}
				}
			}else{
				cnt = 1;
				color = board[i][j];
			}
		}
	}
	for(int j=0; j<m; ++j){
		int color = board[0][j];
		int cnt = 1;
		for(int i=1; i<n; ++i){
			if(board[i][j] == color){
				cnt++;
				if(cnt>=3){
					v.push_back(Pos(i,j));
					if(cnt==3){
						v.push_back(Pos(i-1,j));
						v.push_back(Pos(i-2,j));
					}
				}
			}else{
				cnt = 1;
				color = board[i][j];
			}
		}
	}
	for(int i=0; i<v.size(); ++i){
		int x = v[i].x, y = v[i].y;
		board[x][y] = 0;
	}
	for(int i=0; i<n; ++i){
		for(int j=0; j<m; ++j){
			printf("%d ", board[i][j]);
		}
		printf("\n");
	}
	return 0;
}