Submission #2229173
Source Code Expand
#include<algorithm> #include<iostream> #include<cstring> #include<cstdio> #include<vector> #include<queue> #define MN 800 using namespace std; inline int read() { int x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar(); return x*f; } char st[MN+5][MN+5]; int n,m,K,d[MN+5][MN+5],top=0,vis[MN+5][MN+5]; pair<int,int> q[MN*MN+5]; const int dis[4][2]={{1,0},{-1,0},{0,1},{0,-1}}; int main() { n=read();m=read();K=read(); for(int i=1;i<=n;++i) scanf("%s",st[i]+1); for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) if(st[i][j]=='S') q[++top]=make_pair(i,j),vis[i][j]=1; for(int i=1;i<=top;++i) { int x=q[i].first,y=q[i].second; for(int k=0;k<4;++k) { int nx=x+dis[k][0],ny=y+dis[k][1]; if(nx<1||ny<1||nx>n||ny>m||vis[nx][ny]||st[nx][ny]=='#') continue; vis[nx][ny]=1;q[++top]=make_pair(nx,ny);d[nx][ny]=d[x][y]+1; } } int ans=1e9; for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) if(vis[i][j]) ans=min(ans,max(1,(d[i][j]+K-1)/K)+(min(min(i-1,n-i),min(j-1,m-j))+K-1)/K); cout<<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Closed Rooms |
User | FallDream |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1219 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 10880 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:23:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=1;i<=n;++i) scanf("%s",st[i]+1); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 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 | 5 ms | 4864 KB |
in10.txt | AC | 5 ms | 6912 KB |
in11.txt | AC | 5 ms | 6912 KB |
in12.txt | AC | 5 ms | 4864 KB |
in13.txt | AC | 5 ms | 6912 KB |
in14.txt | AC | 5 ms | 4864 KB |
in15.txt | AC | 5 ms | 6912 KB |
in16.txt | AC | 5 ms | 4864 KB |
in17.txt | AC | 4 ms | 4864 KB |
in18.txt | AC | 4 ms | 4864 KB |
in19.txt | AC | 5 ms | 6912 KB |
in2.txt | AC | 5 ms | 6912 KB |
in20.txt | AC | 2 ms | 4864 KB |
in21.txt | AC | 2 ms | 6400 KB |
in22.txt | AC | 2 ms | 6400 KB |
in23.txt | AC | 5 ms | 6912 KB |
in24.txt | AC | 4 ms | 4864 KB |
in25.txt | AC | 5 ms | 6912 KB |
in26.txt | AC | 26 ms | 10880 KB |
in27.txt | AC | 25 ms | 10880 KB |
in28.txt | AC | 26 ms | 10880 KB |
in29.txt | AC | 26 ms | 10880 KB |
in3.txt | AC | 4 ms | 4864 KB |
in30.txt | AC | 26 ms | 10880 KB |
in31.txt | AC | 26 ms | 10880 KB |
in32.txt | AC | 25 ms | 10880 KB |
in33.txt | AC | 20 ms | 10880 KB |
in34.txt | AC | 20 ms | 10880 KB |
in35.txt | AC | 21 ms | 10880 KB |
in36.txt | AC | 5 ms | 6912 KB |
in37.txt | AC | 5 ms | 4864 KB |
in38.txt | AC | 5 ms | 4864 KB |
in39.txt | AC | 23 ms | 10880 KB |
in4.txt | AC | 5 ms | 4864 KB |
in40.txt | AC | 22 ms | 10880 KB |
in5.txt | AC | 5 ms | 6912 KB |
in6.txt | AC | 5 ms | 4864 KB |
in7.txt | AC | 5 ms | 6912 KB |
in8.txt | AC | 5 ms | 4864 KB |
in9.txt | AC | 4 ms | 4864 KB |
sample1.txt | AC | 2 ms | 6400 KB |
sample2.txt | AC | 2 ms | 6400 KB |
sample3.txt | AC | 2 ms | 6400 KB |