20
5 5
#####
#...#
#...#
#....
.....
3 3
###
###
###
5 5
#####
#####
#####
#####
#####
<27002 bytes omitted>用户输出
5
25
25
25
22
37
5
27
7
57
4
9
0
1
1389
895
915
1
1079
1058
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #20830 | #1010. J. 团队配置，新奇的面试题 | Accepted | 100 | 11 ms | 312 K | C++ 11 / 1.1 K | Diorvh | 2019-08-10 21:31:09 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
for (int i = 1; i <= T; ++i) {
int ans = 0, n, m, N, M, c1, c2;
char flow[100][100], moun[100][100];
bool valid;
cin >> N >> M;
for (int j = 1; j <= N; ++j)
for (int k = 1; k <= M; ++k) cin >> moun[j][k];
cin >> n >> m;
for (int j = 1; j <= n; ++j)
for (int k = 1; k <= m; ++k) cin >> flow[j][k];
for (int j = 1; j <= N; ++j)
for (int k = 1; k <= M; ++k) {
valid = false;
for (int l = 1; l <= n; ++l) {
for (int o = 1; o <= m; ++o) {
c1 = l + j - (n / 2 + 1), c2 = o + k - (m / 2 + 1);
if ((c1 >= 1) && (c1 <= N) && (c2 >= 1) && (c2 <= M) &&
(flow[l][o] == '#' && moun[c1][c2] == '#')) {
valid = true;
break;
}
}
if (valid)
break;
}
if (!valid)
ans++;
}
cout << ans << endl;
}
return 0;
}