思路:遍历所有的行和列,如果相同,则标记,最后根据标记输出即可
#include<iostream>
#include<sstream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
#include<algorithm>
using namespace std;
#define _for(i,lo,hi) for(int i=(lo);i<(hi);i++)
void printvec(vector<int>& vec){
printf("%d",vec[0]);
for(int i=1;i<vec.size();i++){
printf(" %d",vec[i]);
}
printf("\n");
}
int main() {
//freopen("d:\\input.txt","r",stdin);
//freopen("d:\\output.txt","w",stdout);
//遍历所有的行和列,如果相同,则标记,最后根据标记输出即可
int m,n;
cin>>n>>m;
vector<vector<int> > vec(n,vector<int>(m)),flag(n,vector<int>(m,0));
_for(i,0,n)
_for(j,0,m){
cin>>vec[i][j];
}
_for(i,0,n){
_for(j,0,m){
if(j+2<m&&vec[i][j]==vec[i][j+1]&&vec[i][j]==vec[i][j+2])
flag[i][j]=flag[i][j+1]=flag[i][j+2]=1;
if(i+2<n&&vec[i][j]==vec[i+1][j]&&vec[i][j]==vec[i+2][j])
flag[i][j]=flag[i+1][j]=flag[i+2][j]=1;
}
}
_for(i,0,n){
_for(j,0,m){
if(flag[i][j])
vec[i][j]=0;
}
}
_for(i,0,n)printvec(vec[i]);
//_for(i,0,n)printvec(flag[i]);
return 0;
}