Submission #1769044


Source Code Expand

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>

#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

typedef long long LL;
typedef double db;

int get(){
	char ch;
	while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
	if (ch=='-'){
		int s=0;
		while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
		return -s;
	}
	int s=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
	return s;
}

const int N = 805;
const int INF = 1e+9;

int h,w,k;
char s[N][N];
int sx,sy;
int dis[N][N],vis[N][N],tim;
int fx[4][2]={{0,1},{0,-1},{1,0},{-1,0}};

void dfs(int x,int y){
	tim++;
	fo(i,0,3){
		int x1=x+fx[i][0],y1=y+fx[i][1];
		if (x1<1||x1>h||y1<1||y1>w||dis[x1][y1]<INF||s[x1][y1]=='#')continue;
		dis[x1][y1]=dis[x][y]+1;
		vis[x1][y1]=tim;
	}
	int nt=tim;
	fo(i,0,3){
		int x1=x+fx[i][0],y1=y+fx[i][1];
		if (x1<1||x1>h||y1<1||y1>w||vis[x1][y1]!=nt)continue;
		dfs(x1,y1);
	}
}

int main(){
	h=get();w=get();k=get();
	fo(i,1,h){
		scanf("%s",s[i]+1);
		fo(j,1,w)
		if (s[i][j]=='S')sx=i,sy=j;
	}
	fo(i,1,h)fo(j,1,w)dis[i][j]=INF;
	dis[sx][sy]=0;
	dfs(sx,sy);
	int ans=INF;
	fo(i,1,h)
		fo(j,1,w)
		if (s[i][j]!='#'&&dis[i][j]<=k){
			int tmp=min(min(i-1,h-i),min(j-1,w-j));
			if (tmp)tmp=(tmp-1)/k+1;
			ans=min(ans,tmp+1);
		}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task C - Closed Rooms
User samjia2000
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1469 Byte
Status WA
Exec Time 28 ms
Memory 14208 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:59:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",s[i]+1);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 3
AC × 42
WA × 4
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 8 ms 3840 KB
in10.txt AC 8 ms 3968 KB
in11.txt AC 8 ms 3840 KB
in12.txt AC 8 ms 3968 KB
in13.txt AC 8 ms 3968 KB
in14.txt AC 8 ms 3968 KB
in15.txt AC 8 ms 3840 KB
in16.txt AC 8 ms 3968 KB
in17.txt AC 8 ms 3840 KB
in18.txt AC 8 ms 3968 KB
in19.txt AC 8 ms 3968 KB
in2.txt AC 8 ms 3968 KB
in20.txt AC 2 ms 3840 KB
in21.txt AC 2 ms 2304 KB
in22.txt AC 1 ms 2304 KB
in23.txt AC 8 ms 3840 KB
in24.txt AC 8 ms 3968 KB
in25.txt AC 8 ms 3840 KB
in26.txt AC 27 ms 9088 KB
in27.txt AC 27 ms 9088 KB
in28.txt WA 28 ms 9344 KB
in29.txt WA 28 ms 9216 KB
in3.txt AC 8 ms 3968 KB
in30.txt WA 28 ms 8960 KB
in31.txt AC 28 ms 8960 KB
in32.txt AC 27 ms 8576 KB
in33.txt AC 27 ms 14208 KB
in34.txt AC 26 ms 11776 KB
in35.txt AC 23 ms 11520 KB
in36.txt AC 6 ms 3840 KB
in37.txt AC 6 ms 3840 KB
in38.txt AC 6 ms 3840 KB
in39.txt WA 28 ms 13184 KB
in4.txt AC 8 ms 3840 KB
in40.txt AC 28 ms 13312 KB
in5.txt AC 8 ms 3968 KB
in6.txt AC 8 ms 3840 KB
in7.txt AC 9 ms 3968 KB
in8.txt AC 8 ms 3840 KB
in9.txt AC 8 ms 3840 KB
sample1.txt AC 2 ms 2304 KB
sample2.txt AC 2 ms 2304 KB
sample3.txt AC 2 ms 2304 KB