Submission #1768927
Source Code Expand
///////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
// _oo0oo_ //
// o8888888o //
// 88" . "88 ------ hzt1 //
// (| -_- |) //
// 0\ = /0 //
// ___/`---'\___ //
// .' \| |// '. //
// / \||| : |||// \ //
// / _||||| -:- |||||- \ //
// | | \ - /// | | //
// | \_| ''\---/'' |_/ | //
// \ .-\__ '-' ___/-. / //
// ___'. .' /--.--\ `. .'___ //
// ."" '< `.___\_<|>_/___.' >' "". //
// | | : `- \`.;`\ _ /`;.`/ - ` : | | //
// \ \ `_. \_ __\ /__ _/ .-` / / //
// =====`-.____`.___ \_____/___.-`___.-'===== //
// `=---=' //
// //
// //
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ //
// //
// God-He Bless All. //
// This Code Will Never Explode. //
// //
// //
///////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
const int Size=1<<16;
char buffer[Size],*head,*tail;
inline char Getchar() {
if(head==tail) {
int l=fread(buffer,1,Size,stdin);
tail=(head=buffer)+l;
}
if(head==tail) return -1;
return *head++;
}
inline int read() {
int x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
return x*f;
}
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=810;
const int mx[]={1,-1,0,0};
const int my[]={0,0,1,-1};
int n,m,k;
int calc(int i,int j) {
int d=min(min(i,j),min(n-i+1,m-j+1))-1;
return (!d)?0:(d-1)/k+1;
}
char M[maxn][maxn];
int d[maxn][maxn];
pii Q[maxn*maxn];
int solve(int x,int y) {
d[x][y]=1;int l=1,r=0,ans=1e9;
Q[++r]=mp(x,y);
while(l<=r) {
x=Q[l].xx;y=Q[l].yy;l++;
ans=min(ans,calc(x,y)+1);
if(d[x][y]>k) break;
rep(dir,0,3) {
int nx=x+mx[dir],ny=y+my[dir];
if(nx>=1&&ny>=1&&nx<=n&&ny<=m&&!d[nx][ny]&&M[nx][ny]!='#') {
d[nx][ny]=d[x][y]+1;
Q[++r]=mp(nx,ny);
}
}
}
return ans;
}
int main() {
n=read();m=read();k=read();
rep(i,1,n) scanf("%s",M[i]+1);
rep(i,1,n) rep(j,1,m) if(M[i][j]=='S') {
printf("%d\n",solve(i,j));
break;
}
return 0;
}
Submission Info
Submission Time
2017-11-13 10:52:52+0900
Task
C - Closed Rooms
User
wzj52501
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
3418 Byte
Status
AC
Exec Time
16 ms
Memory
8448 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:91:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,1,n) scanf("%s",M[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
3 ms
2304 KB
in10.txt
AC
3 ms
2304 KB
in11.txt
AC
3 ms
4352 KB
in12.txt
AC
3 ms
2304 KB
in13.txt
AC
3 ms
4352 KB
in14.txt
AC
3 ms
2304 KB
in15.txt
AC
3 ms
4352 KB
in16.txt
AC
3 ms
2304 KB
in17.txt
AC
3 ms
2304 KB
in18.txt
AC
3 ms
2304 KB
in19.txt
AC
3 ms
4352 KB
in2.txt
AC
3 ms
4352 KB
in20.txt
AC
1 ms
2304 KB
in21.txt
AC
1 ms
4224 KB
in22.txt
AC
1 ms
4224 KB
in23.txt
AC
3 ms
4352 KB
in24.txt
AC
3 ms
2304 KB
in25.txt
AC
3 ms
4352 KB
in26.txt
AC
3 ms
2432 KB
in27.txt
AC
3 ms
4352 KB
in28.txt
AC
9 ms
5376 KB
in29.txt
AC
16 ms
8448 KB
in3.txt
AC
3 ms
2304 KB
in30.txt
AC
5 ms
4608 KB
in31.txt
AC
3 ms
2304 KB
in32.txt
AC
3 ms
4352 KB
in33.txt
AC
16 ms
8448 KB
in34.txt
AC
16 ms
8448 KB
in35.txt
AC
3 ms
2304 KB
in36.txt
AC
3 ms
4352 KB
in37.txt
AC
3 ms
2304 KB
in38.txt
AC
3 ms
2304 KB
in39.txt
AC
3 ms
2304 KB
in4.txt
AC
3 ms
2304 KB
in40.txt
AC
3 ms
2304 KB
in5.txt
AC
3 ms
4352 KB
in6.txt
AC
3 ms
2304 KB
in7.txt
AC
3 ms
4352 KB
in8.txt
AC
3 ms
2304 KB
in9.txt
AC
3 ms
2304 KB
sample1.txt
AC
1 ms
4224 KB
sample2.txt
AC
1 ms
4224 KB
sample3.txt
AC
1 ms
4224 KB