Submission #162104

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
using namespace std;

int muki[4][2]={{0,1},{1,0},{0,-1},{-1,0}};

int main(){
	int n,m;
	int sx,sy;
	int gx,gy;
	char a[55][55]; for(int i=0;i<55;i++)for(int j=0;j<55;j++)a[i][j]='#';
	scanf("%d%d%d%d%d%d",&n,&m,&sx,&sy,&gx,&gy);
	for(int i=1;i<=n;i++){
		scanf("\n");
		for(int j=1;j<=m;j++){
			scanf("%c",&a[i][j]);
		}
	}

	queue<pair<int,int>> que;
	que.push(pair<int,int>(sx,sy));
	bool used[55][55]; int cost[55][55]; for(int i=0;i<55;i++)for(int j=0;j<55;j++){ used[i][j]=false; cost[i][j]=10000000; }
cost[sx][sy]=0;
	
	while(!que.empty()){
		pair<int,int> p=que.front(); que.pop();
		if(!used[p.first][p.second]){
			for(int i=0;i<4;i++){
				int nx=p.first+muki[i][0],ny=p.second+muki[i][1];
				if(a[nx][ny]!='#'&&cost[nx][ny]>cost[p.first][p.second]+1){
					cost[nx][ny]=cost[p.first][p.second]+1;
					que.push(pair<int,int>(nx,ny));
				}
			}
			used[p.first][p.second]=true;
		}
	}

	printf("%d\n",cost[gx][gy]);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d%d%d",&n,&m,&sx,&sy,&gx,&gy);
                                             ^
./Main.cpp:19:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n");
              ^
./Main.cpp:21:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%c",&a[i][j]);
                        ^

Judge Result