for t in range(int(input())):
n,m=map(int,input().split());mat,dist,sum = [],dict(),0
for i in range(n+m-2):dist[i]=[0,0]
for ii in range(n):
mat.append(list(map(int,input().split())))
for iii in range(m):
if 2*(ii+iii) != n+m-2:dist[min(ii+iii,n+m-2-ii-iii)][mat[ii][iii]] +=1
for val in dist:sum+=min(dist[val])
print(sum)
num_inp=lambda: int(input())
arr_inp=lambda: list(map(int,input().split()))
sp_inp=lambda: map(int,input().split())
str_inp=lambda:input()
#include<iostream>
#include<cmath>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<cstring>
#define AboNasser cin.tie(nullptr); ios::sync_with_stdio(false);
using namespace std;
#define ll long long
typedef pair<int, int> pr;
typedef vector<ll> vll;
ll mod = 1e9 + 7;
ll n;
ll dp[1000001][2];
void solve()
{
int n, m;
cin >> n >> m;
int arr[31][31];
if (m >= n)
{
for (int i = 0;i < n;i++)
for (int j = 0;j < m;j++)
cin >> arr[i][j];
}
else
{
for (int j = 0;j < n;j++)
for (int i = 0;i < m;i++)
cin >> arr[i][j];
swap(n, m);
}
ll ans = 0;
for (int j = 0;j < (m + n - 1) / 2;j++)
{
int x = j, y = 0;
ll o = 0, z = 0;
while (x > -1 && y < n)
{
if (arr[y][x] == 0)
z++;
else
o++;
y++, x--;
}
x = m - j - 1;
y = n - 1;
while (x < m && y > -1)
{
if (arr[y][x] == 0)
z++;
else
o++;
y--, x++;
}
ans += min(z, o);
}
cout << ans << endl;
}
int main()
{
AboNasser
// freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ll t;
cin >> t;
while (t--)
solve();
return 0;
}A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |