Submission #2182753
Source Code Expand
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
struct o{int y,x,d;};
int h,w,k,sy,sx,ans=1000,dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
bool m[805][805];
int r(int y,int x){
return (min(min(x,w-x-1),min(y,h-y-1))+k-1)/k;
}
int main(void){
scanf("%d%d%d",&h,&w,&k);
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
char c;
scanf(" %c",&c);
if(c=='#')m[i][j]=true;
else if(c=='S'){
sy=i;
sx=j;
}
}
}
queue<o>bfs;
bfs.push(o{sy,sx,0});
while(!bfs.empty()){
o u=bfs.front();
bfs.pop();
m[u.y][u.x]=true;;
ans=min(ans,r(u.y,u.x));
if(u.d==k)continue;
for(int i=0;i<4;i++){
int x=u.x+dx[i],y=u.y+dy[i];
if(0<x&&x<w&&y>0&&y<h&&!m[y][x])bfs.push(o{y,x,u.d+1});
}
}
printf("%d\n",ans+1);
}
Submission Info
Submission Time
2018-03-11 18:15:08+0900
Task
C - Closed Rooms
User
nxteru
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
982 Byte
Status
TLE
Exec Time
2151 ms
Memory
763716 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:13:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&h,&w,&k);
^
./Main.cpp:17:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %c",&c);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 700
Status
Set Name
Test Cases
Sample
sample1.txt, sample2.txt, sample3.txt
All
sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name
Status
Exec Time
Memory
in1.txt
AC
31 ms
896 KB
in10.txt
AC
31 ms
896 KB
in11.txt
AC
31 ms
896 KB
in12.txt
AC
31 ms
896 KB
in13.txt
AC
31 ms
896 KB
in14.txt
AC
31 ms
896 KB
in15.txt
AC
31 ms
896 KB
in16.txt
AC
31 ms
896 KB
in17.txt
AC
32 ms
896 KB
in18.txt
AC
31 ms
896 KB
in19.txt
AC
31 ms
896 KB
in2.txt
AC
31 ms
896 KB
in20.txt
AC
2 ms
896 KB
in21.txt
AC
1 ms
256 KB
in22.txt
AC
1 ms
256 KB
in23.txt
AC
30 ms
896 KB
in24.txt
AC
30 ms
896 KB
in25.txt
AC
30 ms
896 KB
in26.txt
TLE
2132 ms
455532 KB
in27.txt
AC
30 ms
896 KB
in28.txt
TLE
2125 ms
350584 KB
in29.txt
TLE
2120 ms
283940 KB
in3.txt
AC
31 ms
896 KB
in30.txt
TLE
2122 ms
289708 KB
in31.txt
AC
30 ms
896 KB
in32.txt
AC
30 ms
896 KB
in33.txt
TLE
2151 ms
763716 KB
in34.txt
TLE
2151 ms
757520 KB
in35.txt
AC
149 ms
37680 KB
in36.txt
AC
29 ms
896 KB
in37.txt
AC
29 ms
896 KB
in38.txt
AC
29 ms
896 KB
in39.txt
AC
29 ms
896 KB
in4.txt
AC
31 ms
896 KB
in40.txt
AC
29 ms
896 KB
in5.txt
AC
31 ms
896 KB
in6.txt
AC
31 ms
896 KB
in7.txt
AC
31 ms
896 KB
in8.txt
AC
31 ms
896 KB
in9.txt
AC
31 ms
896 KB
sample1.txt
AC
1 ms
256 KB
sample2.txt
AC
1 ms
256 KB
sample3.txt
AC
1 ms
256 KB