T84341 Jelly的难题1

#include<bits/stdc++.h>

using namespace std;

const int mod=19260817;
int n,m,sx,sy,t;
long long much;
char ju[505][505];
int vis[505][505];
int dis[505][505];

int dx[4]={-1,0,0,1};
int dy[4]={0,-1,1,0};

struct node
{
    int x,y;
};

queue<node>q;

int main()
{
    scanf("%d%d\n",&n,&m);
    memset(vis,-1,sizeof(vis));
    memset(dis,0,sizeof(dis));
    
    for(int i=1;i<=n;i++)
      for(int j=1;j<=m;j++)
      {
          cin>>ju[i][j];  //我的锅就在这里QWQ 
          
          if(ju[i][j]=='*')
          {
              sx=i;sy=j;
            vis[i][j]=1;    
        }
        if(ju[i][j]=='o')
          vis[i][j]=1;
        if(ju[i][j]=='#')
          vis[i][j]=0;
      }

    node h;
    h.x =sx;h.y =sy;
    q.push(h);
  
    while(!q.empty())
    {
        
        node now=q.front();
        q.pop();
        t=max(t,dis[now.x][now.y]);

        for(int i=0;i<=3;i++)
        {
            int xx=now.x +dx[i];
            int yy=now.y +dy[i];
            if(vis[xx][yy]==0)
            {
                dis[xx][yy]=dis[now.x ][now.y ]+1;
                vis[xx][yy]=1;
                node h;
                h.x =xx;
                h.y =yy;
                q.push(h);
            }
        }
    }

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            if(dis[i][j]!=0)
            {
                dis[i][j]=t-dis[i][j]+1;
            much=(much%mod+dis[i][j]%mod)%mod;
          }
            
        }
    
    printf("%d\n",t);
    printf("%ld\n",much);

    return 0;
}