按自己思考起来最舒服的思路写出了n^3的做法,TLE无疑
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
const int N = 2010;
const int mod = 998244353;
string s[N];
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int cnt1 = 0;
for (int i = 0;i < n;i++) {
cin >> s[i];
for (int j = 0;j < n;j++)
if (s[i][j] == '1') cnt1++;
}
int minm = 0x3f3f3f3f;
for (int i = 0;i < n;i++)
for (int j = 0;j < n;j++)
{
int cnt2 = 0;
for (int k = 0;k < n;k++)
if (s[(n - i + k) % n][(n - j + k) % n] == '1') cnt2++;
//我们可以发现有一维是没必要的,把n-i看成一个常数,第一维随着k变化,第二维随着j和k变化,这样就能搜到所有状态了,所以我们干脆把第一维的i去掉
minm = min(minm, n + cnt1 - 2 * cnt2);
}
cout << minm << endl;
}
}
观察代码看看怎么优化,可以发现了第一维的枚举是冗余的,具体是怎么个冗余,注释在代码里了
ac代码
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
const int N = 2010;
const int mod = 998244353;
string s[N];
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int cnt1 = 0;
for (int i = 0;i < n;i++) {
cin >> s[i];
for (int j = 0;j < n;j++)
if (s[i][j] == '1') cnt1++;
}
int minm = 0x3f3f3f3f;
for (int j = 0;j < n;j++)
{
int cnt2 = 0;
for (int k = 0;k < n;k++)
if (s[k % n][(n - j + k) % n] == '1') cnt2++;
minm = min(minm, n + cnt1 - 2 * cnt2);
}
cout << minm << endl;
}
}