Advertisement
Guest User

Untitled

a guest
Nov 20th, 2019
115
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.85 KB | None | 0 0
  1. #include <iostream>
  2. #incude <fstream>
  3.  
  4.  
  5. using namespace std;
  6.  
  7. ifstream fin("fill.in");
  8. ofstream fout("fil.out");
  9.  
  10. int A[101][101] , n , m;
  11. const int di[] = {0 , 0 , 1 , -1},
  12. dj[] = {1 , -1 , 0 ,0};
  13.  
  14. void Fill(int i , int j , int val)
  15. {
  16. if(i >= 1 && i <= n && j >= 1 && j <= m && A[i][j] == 1)
  17. {
  18. A[i][j] = val;
  19. for(int k = 0 ; k < 4 ; k++)
  20. Fill(i + di[k] , j + dj[k]);
  21. }
  22. }
  23.  
  24.  
  25. int main()
  26. {
  27. fin >> n >> m;
  28. for(int i = 1 ; i <= n ; i++)
  29. for(int j = 1 ; j <= m ; j++)
  30. fin >> A[i][j];
  31. int cnt = 0;
  32. for(int i = 1 ; i <= n ; i++)
  33. for(int j = 1 ; j <= m ; j++)
  34. if(A[i][j] == 1)
  35. {
  36. cnt++;
  37. Fill(i , j , 2);
  38. }
  39. fout << cnt;
  40. return 0;
  41. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement