Guest User

Untitled

a guest
Nov 19th, 2019
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.97 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. #define ll long long int
  3.  
  4. using namespace std;
  5.  
  6.  
  7. int main(){
  8.  
  9. ll t; cin>>t;
  10.  
  11. while(t--){
  12.  
  13. int n,m; cin>>n>>m;
  14. int a[n][m],b[n][m];
  15. string s;
  16.  
  17. for(int i=0;i<n;i++){
  18. cin>>s;
  19. for(int j=0;j<m;j++){
  20. a[i][j] = (s[j] - '0');
  21. }
  22. }
  23.  
  24.  
  25. for(int i=0;i<n;i++){
  26. cin>>s;
  27. for(int j=0;j<m;j++){
  28. b[i][j] = (s[j] - '0');
  29. }
  30. }
  31.  
  32. int dr = -n, dc = -m;
  33. int ans = INT_MAX, r , c, cmp, tp;
  34.  
  35. while(dr < n){
  36. dc = -m;
  37. while(dc < m){
  38. tp = 0;
  39. for(int i=0;i<n;i++){
  40. for(int j=0;j<m;j++){
  41. r = i + dr;
  42. c = j + dc;
  43. if(r < 0 || r > n || c < 0 || c > m){
  44. cmp = 0;
  45. }
  46. else{
  47. cmp = b[r][c];
  48. }
  49. if(cmp != a[i][j]){
  50. tp++;
  51. }
  52. }
  53. }
  54.  
  55. ans = min(ans,tp);
  56. dc++;
  57. }
  58. dr++;
  59. }
  60. cout<<"ANS "<<ans<<endl;
  61. }
  62.  
  63. return 0;
  64. }
Add Comment
Please, Sign In to add comment