Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int ar[101][101];
- bool check[101][101];
- int main(){
- int n,m;
- scanf("%d %d",&n,&m);
- for(int i=1;i<=n;i++){
- for(int j=1;j<=m;j++){
- scanf("%d",&ar[i][j]);
- }
- }
- int r,c,k,color;
- scanf("%d %d %d",&r,&c,&k);
- color=ar[r][c];
- ar[r][c]=k;
- queue <int> qx,qy;
- qx.push(r);
- qy.push(c);
- int kx[4]={0,0,1,-1};
- int ky[4]={1,-1,0,0};
- while(qx.size()>0){
- int x,y;
- x=qx.front();
- y=qy.front();
- qx.pop();
- qy.pop();
- for(int i=0;i<4;i++){
- if(x+kx[i]<=n && x+kx[i]>=1 && y+ky[i]<=m && y+ky[i]>=1 && check[x+kx[i]][y+ky[i]]==false && ar[x+kx[i]][y+ky[i]]==color){
- check[x+kx[i]][y+ky[i]]=true;
- ar[x+kx[i]][y+ky[i]]=k;
- qx.push(x+kx[i]);
- qy.push(y+ky[i]);
- }
- }
- }
- for(int i=1;i<=n;i++){
- for(int j=1;j<=m;j++){
- printf("%d ",ar[i][j]);
- }
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement