Submission #17092

#	Time	Username	Problem	Language	Result	Execution time	Memory
17092		hjk0553	토마토 (KOI13_tomato)	C++98	3.20 / 16	129 ms	5840 KiB

tomato

#include<bits/stdc++.h>
struct point
{
    int x;
    int y;
};
int t[1010][1010];
int n,mm,ans;
int main()
{
      std::queue <point> q;
      point m,l;
      scanf("%d %d",&n,&mm);
      for(int i=1;i<=n;i++)
      {
          for(int j=1;j<=mm;j++)
          {
             scanf("%d",&t[i][j]);
             if(t[i][j]==1)
             {
                m.x=i,m.y=j;
                q.push({m.x,m.y});
             }
          }
      }
      while(!q.empty())
      {
            l=q.front();
            q.pop();
            if(t[l.x-1][l.y]==0&&l.x-1>0) t[l.x-1][l.y]=t[l.x][l.y]+1,q.push({l.x-1,l.y}); //왼쪽 push
            if(t[l.x+1][l.y]==0&&l.x+1<=n) t[l.x+1][l.y]=t[l.x][l.y]+1,q.push({l.x+1,l.y}); //오른쪽 push
            if(t[l.x][l.y-1]==0&&l.y-1>0) t[l.x][l.y-1]=t[l.x][l.y]+1,q.push({l.x,l.y-1}); //위쪽 push
            if(t[l.x][l.y+1]==0&&l.y+1<=mm) t[l.x][l.y+1]=t[l.x][l.y]+1,q.push({l.x,l.y+1}); //아래쪽 push
      }
      for(int i=1;i<=n;i++) for(int j=1;j<=mm;j++) if(t[i][j]==0) {printf("-1");return 0;} else if(t[i][j]>ans) ans=t[i][j];
      printf("%d",ans-1);
      return 0;
}

• Subtask 1: 1.6 / 1.6
• Subtask 2: 0 / 1.6
• Subtask 3: 0 / 1.6
• Subtask 4: 1.6 / 1.6
• Subtask 5: 0 / 1.6
• Subtask 6: 0 / 1.6
• Subtask 7: 0 / 1.6
• Subtask 8: 0 / 1.6
• Subtask 9: 0 / 1.6
• Subtask 10: 0 / 1.6