meaning:题意就是给一个图,图的4周会存在2个门,然后问这些门到这个图中最远的空地需要最少多少步。
thinking:直接BFS
the reason of failure:1、gets的不能使用,应该用scanf("%c",&a);的方法来输入空格到数组中。
2、代码错误,中间代码写错了,应该列是从0开始,而不是1,过一部分数据只表明前面那些数据没涉及这个问题.
代码:
/*
ID: me
PROG: maze1
LANG: C++
*/
//#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
struct ttt{
int r,c;
int step;
};
int dr[4]={0,1,-1,0};
int dc[4]={1,0,0,-1};
char map1[250][80];
char kk[500];
int walked[250][250];
ttt s1,s2;
int main(){
//freopen("in.txt","r",stdin);
freopen("maze1.in","r",stdin);
freopen("maze1.out","w",stdout);
int i,j,k,l,f1,f2,f3,t1,t2,t3;
int r,c,n,m;
char d;
cin >> c >> r;
scanf("%c",&d);
memset(walked,0,sizeof(walked));
memset(map1,0,sizeof(map1));
//cout << c << r <<endl;
for(i=1;i<=r*2+1;i++){ //注意不用gets,如何输入空格
n=0;
while(scanf("%c",&d)==1&&d!='\n'){
map1[i][n++]=d;
}
//cout << endl;
}
s1.r=0;
s1.c=0;
s2.r=0;
s2.c=0;
// for(i=1;i<=r*2+1;i++){
// for(j=0;j<=c*2;j++)
// cout <<map1[i][j];
//cout << endl;
//}
for(i=0;i<c*2+1;i++){
if(map1[1][i]==' '){
if(s1.r==0){
s1.r=1;
s1.c=i;
}else{
s2.r=1;
s2.c=i;
}
}
if(map1[r*2+1][i]==' '){
if(s1.r==0){
s1.r=r*2+1;
s1.c=i;
//cout << i << endl;
}else{
s2.r=r*2+1;
s2.c=i;
}
}
}
//cout << map1[r*2+1][3] << endl;
for(i=1;i<=r*2+1;i++){ //2、列是0而不是1,注意检查代码
if(map1[i][0]==' '){
if(s1.r==0){
s1.r=i;
s1.c=0;
}else{
s2.r=i;
s2.c=0;
}
}
if(map1[i][c*2]==' '){
if(s1.r==0){
s1.r=i;
s1.c=c*2;
}else{
s2.r=i;
s2.c=c*2;
}
}
}
s1.step=1;s2.step=1; //注意开始算几个
queue<ttt>qq;
qq.push(s1);
qq.push(s2);
int g1=0;
walked[s1.r][s1.c]=1;
walked[s2.r][s2.c]=1;
//cout << s1.r << " "<< s1.c <<endl;
//cout << s2.r << " "<< s2.c <<endl;
while(!qq.empty()){
s1=qq.front();qq.pop();
// cout << s1.r <<" " << s1.c << " " << s1.step <<endl;
if(s1.step>g1)g1=s1.step;
for(i=0;i<4;i++){
s2.r=s1.r+dr[i];
s2.c=s1.c+dc[i];
s2.step=s1.step;
if(s2.r%2==0&&s2.c%2==1) //是由s2判断是否+
s2.step++;
if(s2.r>=1&&s2.r<=2*r+1&&s1.c>=0&&s1.c<=2*c&&map1[s2.r][s2.c]==' '
&&walked[s2.r][s2.c]==0){
walked[s2.r][s2.c]=s2.step;
qq.push(s2);
}
}
}
cout << g1-1 << endl;
return 0;
}