pypy3 解法, 执行用时: 991ms, 内存消耗: 35036K, 提交时间: 2023-02-16 17:02:57

l = [int(i) for i in input().split()]
n = l[0]
m = l[1]
map = []
mode = [[1,0],[0,1],[1,1],[-1,1]]
cout = [0,0]
def score(r,c,n,nn):
    rr = mode[nn][0]
    cc =mode[nn][1]  
    for i in range(5):
        if i==4:
            cout[n-1] = cout[n-1] + 1
            break
        if map[r + rr*(i+1)][c + cc*(i+1)] != n:
            break
for i in range(n):
    colom = input()
    map.append([0,0,0,0]+[int(colom[i]) for i in range(m)]+[0,0,0,0])
for op in range(4):
    map.append([0]*(m+8))
for r in range(n):
    for c in range(m):
        for ii in range(4):
            if map[r][c+4] == 0:
                break
            score(r,c+4,map[r][c+4],ii)
print(cout[0],cout[1])

C++(g++ 7.5.0) 解法, 执行用时: 52ms, 内存消耗: 1404K, 提交时间: 2022-11-05 13:46:24

#include<iostream>
using namespace std;
int N=1010;
typedef long long ll;

char ch[1010][1010];
int n,m;
int fun(char c)
{
	int cnt=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			int k1=1,k2=1,k3=1,k4=1;
			for(int k=0;k<5;k++)
			{
				if(j+k>m||ch[i][j+k]!=c)k1=0;
				if(i+k>n||ch[i+k][j]!=c)k2=0;
				if(j+k>m||i+k>n||ch[i+k][j+k]!=c)k3=0;
				if(j-k<1||i+k>n||ch[i+k][j-k]!=c)k4=0;
			}	
			cnt+=k1+k2+k3+k4;	
		}
	}
	return cnt;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
        cin>>ch[i]+1;
    cout<<fun('1')<<" "<<fun('2')<<endl;
	return 0;
}

C++(clang++ 11.0.1) 解法, 执行用时: 189ms, 内存消耗: 2392K, 提交时间: 2022-11-18 22:30:33

#include<iostream>
using namespace std;
char g[1005][1005];
int n,m;

int bfs(char c){

int cnt=0;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
int k1=1,k2=1,k3=1,k4=1;
for(int k=0;k<5;++k){
if(i+k>n|| g[i+k][j]!=c)k1=0;
if(j+k>m|| g[i][j+k]!=c)k2=0;
if(i+k>n||j+k>m|| g[i+k][j+k]!=c)k3=0;
if(i+k>n||j-k<1|| g[i+k][j-k]!=c)k4=0;

}
cnt+=k1+k2+k3+k4;


}

}

return cnt;
}




int main()
{
cin>>n>>m;
for(int i=1;i<=n;++i)scanf("%s",g[i]+1);
cout<<bfs('1')<<' '<<bfs('2')<<endl;
    return 0;
}