题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
#include<bits/stdc++.h>
using namespace std;
long long check(int a,int b,int c,int d)
{
int x[4];
x[0] = a,x[1] = b,x[2] = c,x[3] = d;
sort(x,x+4);
//cout << x[0] << ' ' << x[1] << ' ' << x[2] << ' '<< x[3] << endl;
long long r = 0;
r += (x[1] - x[0]) + (x[3] - x[2]) + 2 * (x[2] - x[1]);
return r;
}
int main()
{
int t;
cin >> t;
int q[110][110];
while(t --)
{
memset(q,0,sizeof(q));
int n,m;
cin >> n >> m;
for(int i = 1;i <= n;i ++)
for(int j = 1;j <=m;j ++)
cin >> q[i][j];
long long res = 0;
for(int i = 1;i <= n/2;i++)
for(int j = 1;j <=m/2;j ++)
res += check(q[i][j],q[n-i+1][j],q[i][m-j+1],q[n-i+1][m-j+1]);
if(n%2 == 1)
for(int j = 1;j <= m/2;j++)
res += abs(q[n/2 + 1][j] - q[n/2 + 1][m-j+1]);
if(m%2 == 1)
for(int i = 1;i <= n/2;i++)
res += abs(q[i][m/2 + 1] - q[n-i+1][m/2 + 1]);
cout << res << endl;
}
return 0;
}