Competitive_Programming/Flood_Fill_ar.cpp at master · CodeDude19/Competitive_Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include<bits/stdc++.h>
using namespace std;
int matrix[100][100];
void prm(int row, int coln)
{
  for(int i=0;i<row;i++){for(int j=0;j<coln;j++)cout<<matrix[i][j]<<" ";}
  cout<<"\n";
}
void rec_func(int i,int j,int num,int target,int row,int coln)
{
  if(i<0 || i>row || j<0 || j>coln) return ;
  if(matrix[i][j] == target) return;
  if(matrix[i][j] != num) return;
  else matrix[i][j] = target;
  rec_func(i+1,j,num,target,row,coln);
  rec_func(i,j+1,num,target,row,coln);
  rec_func(i-1,j,num,target,row,coln);
  rec_func(i,j-1,num,target,row,coln);
}
int main()
{
  int t;
  cin>>t;
  while(t--)
  {
    int row,coln,x,y,target,num;
    cin>>row>>coln;
    for(int i=0;i<row;i++){for(int j=0;j<coln;j++){int temp;cin>>temp;matrix[i][j]=temp;}}
    cin>>x>>y>>target;
    num = matrix[x][y];
    rec_func(x,y,num,target,row,coln);
    prm(row,coln);
  }
  return 0;
  // int[][8] matrix({{1, 1, 1, 1, 1, 1, 1, 1},
  //                 {1, 1, 1, 1, 1, 1, 0, 0},
  //                 {1, 0, 0, 1, 1, 0, 1, 1},
  //                 {1, 2, 2, 2, 2, 0, 1, 0},
  //                 {1, 1, 1, 2, 2, 0, 1, 0},
  //                 {1, 1, 1, 2, 2, 2, 2, 0},
  //                 {1, 1, 1, 1, 1, 2, 1, 1},
  //                 {1, 1, 1, 1, 1, 2, 2, 1},});
}