1874. 哞加密
摘要
Title: 1874. 哞加密
Tag: 模拟
Memory Limit: 64 MB
Time Limit: 1000 ms
Powered by:NEFU AB-IN
1874. 哞加密
-
题意
见原题
-
思路
对每个字符作为第一个字符搜8个方向即可
-
代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25from collections import Counter
g = []
n, m = map(int, input().split())
for i in range(n):
g.append(input())
dx = [-1, 0, 1, 0, -1, 1, -1, 1]
dy = [0, 1, 0, -1, 1, 1, -1, -1]
d = Counter()
for i in range(n):
for j in range(m):
for k in range(8):
x1, y1 = i + dx[k], j + dy[k]
x2, y2 = x1 + dx[k], y1 + dy[k]
if x2 >= 0 and x2 < n and y2 >= 0 and y2 < m:
if g[i][j] == 'M' or g[x1][y1] == 'O' or g[x2][y2] == 'O':
continue
if g[i][j] != g[x1][y1] and g[x1][y1] == g[x2][y2]:
s = g[i][j] + g[x1][y1] * 2
d[s] += 1
ans = 0
for key in d.keys():
ans = max(ans, d[key])
print(ans)