1461B - Find the Spruce - CodeForces Solution

#include<bits/stdc++.h>
#define ll long long
using namespace std;
char arr[510][510];
ll jilu[510][510];
void solve()
{
    int n,m;
    cin>>n>>m;
    memset(jilu,0,sizeof jilu);
    for(int i=1;i<=n;i++)
        cin>>arr[i]+1;
    for(int i=1;i<=n;i++)
    {
        int flag=0,cnt=1;
        for(int j=1;j<=m;j++)
        {
            if(flag==0&&arr[i][j]=='*')
            {
                flag=1;
                jilu[i][j]=++cnt;
            }
            else if(arr[i][j]=='*')
            {
                jilu[i][j]=cnt;
            }
            else
                flag=0;
        }
    }
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(arr[i][j]=='*')
            {
                for(int k=1;k<=n;k++)
                {
                    if(i+k>n)
                    {
                        ans+=k;
                        break;
                    }
                    if(j-k<0||j+k>m)
                    {
                        ans+=k;
                        break;
                    }
                    if(jilu[i+k][j-k]!=0&&jilu[i+k][j+k]!=0&&jilu[i+k][j+k]==jilu[i+k][j-k])
                        continue;
                    else
                    {
                        ans+=k;
                        break;
                    }
                }
            }
        }
    }
    cout<<ans<<'\n';
}
int main()
{
    int t;
    cin>>t;
    while(t--)solve();
}