Submission #1777197

---

Source Code Expand

#include"bits/stdc++.h"


#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = (l);x<=(u);x++)
#define RREP(x,l,u) for(ll x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;

const int maxn = 810;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);

template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}

int n,m,K;

char st[maxn][maxn];

int d[maxn][maxn];

queue<PII> Q;

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

void Work(){
	REP(i,1,n)REP(j,1,m)d[i][j]=K+1;
	REP(i,1,n)REP(j,1,m)if(st[i][j]=='S'){
		d[i][j]=0;
		Q.push(MP(i,j));
	}
	while(!Q.empty()){
		int x=Q.front().fi,y=Q.front().se;Q.pop();
		REP(k,0,3){
			int tx=x+dx[k],ty=y+dy[k];
			if(st[tx][ty]!='.')continue;
			if(d[tx][ty]>d[x][y]+1){
				d[tx][ty]=d[x][y]+1;
				Q.push(MP(tx,ty));
			}
		}
	}
	int ans=n+m;
	REP(i,1,n)REP(j,1,m)if(d[i][j]<=K){
		int x=min(min(i-1,j-1),min(n-i,m-j));
		ans=min(ans,(x+K-1)/K+1);
	}
	iout(ans);
}

void Init(){
	read(n,m,K);
	REP(i,1,n)scanf("%s",st[i]+1);
}

int main(){
	Init();
	Work();
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void Init()’:
./Main.cpp:84:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i,1,n)scanf("%s",st[i]+1);
                               ^

Judge Result