2011年华为编程大赛题目

3.公交站寻址（50分）

l   问题描述

一个N*N二维矩阵代表城市布局，元素值只有’.’,’X’ , ‘B’ , ‘S’，X代表当前位置，B代表路障，S代表公交站，’.’代表可行的路径。

现给定路径长度Y，找到能够到达的公交站的个数，路径中不能包含路障。

路径长度定义：

1、  节点与其自身的距离为0

2、  节点与其上、下、左、右四个相邻节点距离都为1

l   要求实现函数

int FindStat (const char *Map, unsigned int iArrN, unsigned int iPathLen)

【输入】Map：      城市布局

iArrN：         城市布局矩阵的行数

iPathLen:      给定的路径长度

【输出】无

【返回】能够到达的公交站个数

注：输入矩阵是以一维形式保存的二维数组，

比如输入为{‘A’, ‘B’, ‘C’, ‘D’, ‘E’, ‘F’,’G’, ‘H’, ‘I’}，

实际上表示如下3*3的矩阵

‘A’,’B’,’C’,

‘D’,’E’,’F’,

‘G’,’H’,’I’

l   示例

输入："...S........X.S.....S....", 5, 3

返回：2

 

输入："S...S.........BS........X", 5, 5

返回：1

#include<stdio.h>
#include<stdlib.h>
#include<queue>

int FindStat (const char *Map, unsigned int iArrN, unsigned int iPathLen)
{
  int arrCount = iArrN*iArrN;
  int iVisited, xDirect, sum = 0;
  int locationX = -1;
  char* visited = (char *)malloc(arrCount * sizeof(char));
  int* path = (int *)malloc(arrCount * sizeof(int));

  for(int i = 0; i < arrCount; i++)
    {
      if(Map[i] == '.'||Map[i] == 'S') visited[i] = -1;
      else if(Map[i] == 'B')
    {
      visited[i] = 0;
      path[i] = -1;
    }
      if(Map[i] == 'X') locationX = i;
     
    }


  std::queue<int> myqueue;
  visited[locationX] = 1;
  myqueue.push(locationX);
  while(!myqueue.empty())
    {
      iVisited = myqueue.front();
      myqueue.pop();
      xDirect = iVisited + 5;
      if((xDirect) < arrCount) 
    if(visited[xDirect] == -1)
      {
        path[xDirect] = path[iVisited] + 1;
        visited[xDirect] = 1;
        myqueue.push(xDirect);
      }
      xDirect = iVisited - 5;
      if((xDirect) >= 0) 
    if(visited[xDirect] == -1)
      {
        path[xDirect] = path[iVisited] + 1;
        visited[xDirect] = 1;
        myqueue.push(xDirect);
      }
      xDirect = iVisited +1;
        if(iVisited%5 != 4) 
    if(visited[xDirect] == -1)
      {
        path[xDirect] = path[iVisited] + 1;
        visited[xDirect] = 1;
        myqueue.push(xDirect);
      }
      xDirect = iVisited - 1;
      if((xDirect) >= 0) 
    if(visited[xDirect] == -1)
      {
        path[xDirect] = path[iVisited] + 1;
        visited[xDirect] = 1;
        myqueue.push(xDirect);
      }

    }
for(int i = 0; i < arrCount; i++)
    {
      if(Map[i] == 'S'&&path[i]<=iPathLen) sum++;
      if(i%5 == 0)printf("\n");
    printf("%d", path[i]);
    }
printf("\n%d\n",sum);
free(visited);
free(path);
}

int main()
{
  // char map1[] = "S...S.........BS........X";
  char map[]="...S........X.S.....S....";
   FindStat(map, 5, 3);
  // FindStat(map1, 5, 5);
}