N - Find a way

傻傻的写了两个搜索一人一个
然后要注意，不是两个人都能走到某个点的，所以一定要把那个点去掉。
至于搜索就都是常规操作了

struct node {int x, y;int s;
};
char map[len][len];
int vis1[len][len], vis2[len][len];
int dv[4][2] = {{1,0},{0,-1},{0,1},{-1,0}};
int n, m;
int x1,y1,x2,y2;
struct node head;
queue <struct node> q;

int main(){while (cin >> n >> m) {Init();struct node tmp_1;tmp_1.x = x1; tmp_1.y = y1; tmp_1.s = 0;q.push(tmp_1);bfs1();struct node tmp_2;tmp_2.x = x2; tmp_2.y = y2; tmp_2.s = 0;while (!q.empty()) q.pop();q.push(tmp_2);bfs2();int min = maxn;for (int i=0; i<n; i++){for (int j=0; j<m; j++){if (map[i][j] == '@'){if (vis1[i][j] != 0 && vis2[i][j] != 0){if (min > vis1[i][j] + vis2[i][j])min = vis1[i][j] + vis2[i][j];}}}}cout << min * step << endl;//step = 11；}return 0;
}

void Init(){memset(vis1, 0, sizeof(vis1));memset(vis2, 0, sizeof(vis2));memset(map, '.', sizeof(map));x1 = 0; x2 = 0; y1 = 0; y2 = 0;for (int i=0; i<n; i++){for (int j=0; j<m; j++){cin >> map[i][j];if(map[i][j] == 'Y'){x1 = i;y1 = j;}if(map[i][j] == 'M'){x2 = i; y2 = j;}}}vis1[x1][y1] = 1; vis2[x2][y2] = 1;while (!q.empty()) q.pop();}

void bfs1(){while (!q.empty()) {head = q.front();q.pop();for (int i=0; i<4; i++){int _x = head.x + dv[i][0];int _y = head.y + dv[i][1];if (_x < 0 || _y < 0 || _x >=n || _y>= m)continue;if (vis1[_x][_y] != 0) continue;if (map[_x][_y] == '#') continue;if (map[_x][_y] == '@') {vis1[_x][_y] = head.s + 1;struct node tmp;tmp.x = _x; tmp.y = _y; tmp.s = head.s + 1;q.push(tmp);}else{vis1[_x][_y] ++;struct node tmp;tmp.x = _x; tmp.y = _y; tmp.s = head.s + 1;q.push(tmp);}}}
}

void bfs2(){while (!q.empty()) {head = q.front();q.pop();for (int i=0; i<4; i++){int _x = head.x + dv[i][0];int _y = head.y + dv[i][1];if (_x < 0 || _y < 0 || _x >=n || _y>= m)continue;if (vis2[_x][_y] != 0) continue;if (map[_x][_y] == '#') continue;if (map[_x][_y] == '@') {vis2[_x][_y] = head.s + 1;struct node tmp;tmp.x = _x; tmp.y = _y; tmp.s = head.s + 1;q.push(tmp);}else{vis2[_x][_y] ++;struct node tmp;tmp.x = _x; tmp.y = _y; tmp.s = head.s + 1;q.push(tmp);}}}
}

N - Find a way

最新文章

热门文章