题意:给一个图,上面有多个√,每个√占2d+1个格子,问能否用d>=k的√复原原图。
注意:√必须要对称
上手出现的问题:题目有点复杂,没看明白
解法:将图读入a数组,用b数组在d>=k的条件下复原a数组,最后比较两个数组
#include<bits/stdc++.h>
using namespace std;
int t, n, a[30][30],b[30][30],m,k;
void pan(int i, int j) {
int d = 1,dd=0;
if (a[i - d][j - d] && a[i - d][j + d]);
else return;
for (d = 1; d <= 99; d++) {
if (i >= d && j >= d && j + d <= m && j - d >= 1 && a[i - d][j + d] == 1 && a[i - d][j - d] == 1) {
dd++;
}
}
if (dd < k)return;
for ( d = 1; d <= 99; d++) {//要a数组存在√时,b数组才√
if (i >= d&&j>=d&&j+d<=m&&j-d>=1&& a[i - d][j + d] == 1&& a[i - d][j - d] == 1) {
b[i - d][j + d] = 1, b[i - d][j - d] = 1, b[i][j] = 1;
}
else break;
}
return ;
}
int main() {
cin >> t;
while (t--) {
memset(a, 0, sizeof a);
memset(b, 0, sizeof b);
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char c; cin >> c;
if (c == '*')a[i][j] = 1;
}
}
for(int i=n;i>=1+k;i--)
for (int j = 1; j <= m; j++) {//从最底行开始打√
if (a[i][j] == 1)pan(i, j);
}
int flag = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i][j] != b[i][j])flag = 0;
}
}
if (flag)cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}