Maze

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)

Problem Description

This story happened on the background of Star Trek.

Spock, the deputy captain of Starship Enterprise, fell into Klingon’s trick and was held as prisoner on their mother planet Qo’noS.

The captain of Enterprise, James T. Kirk, had to fly to Qo’noS to rescue his deputy. Fortunately, he stole a map of the maze where Spock was put in exactly.

The maze is a rectangle, which has n rows vertically and m columns horizontally, in another words, that it is divided into n*m locations. An ordered pair (Row No., Column No.) represents a location in the maze. Kirk moves from current location to next costs
1 second. And he is able to move to next location if and only if:

Next location is adjacent to current Kirk’s location on up or down or left or right(4 directions)

Open door is passable, but locked door is not.

Kirk cannot pass a wall

There are p types of doors which are locked by default. A key is only capable of opening the same type of doors. Kirk has to get the key before opening corresponding doors, which wastes little time.

Initial location of Kirk was (1, 1) while Spock was on location of (n, m). Your task is to help Kirk find Spock as soon as possible.

Input

The input contains many test cases.

Each test case consists of several lines. Three integers are in the first line, which represent n, m and p respectively (1<= n, m <=50, 0<= p <=10).

Only one integer k is listed in the second line, means the sum number of gates and walls, (0<= k <=500).

There are 5 integers in the following k lines, represents x_i1, y_i1, x_i2, y_i2, g_i; when g_i >=1, represents there is a gate of type gi between location (x_i1, y_i1) and (x_i2,
y_i2); when g_i = 0, represents there is a wall between location (x_i1, y_i1) and (x_i2, y_i2), ( | x_i1 - x_i2 | + | y_i1 - y_i2 |=1, 0<= g_i <=p
)

Following line is an integer S, represent the total number of keys in maze. (0<= S <=50).

There are three integers in the following S lines, represents x_i1, y_i1 and q_i respectively. That means the key type of q_i locates on location (x_i1, y_i1), (1<= q_i<=p).

Output

Output the possible minimal second that Kirk could reach Spock.

If there is no possible plan, output -1.

Sample Input

4 4 9
9
1 2 1 3 2
1 2 2 2 0
2 1 2 2 0
2 1 3 1 0
2 3 3 3 0
2 4 3 4 1
3 2 3 3 0
3 3 4 3 0
4 3 4 4 0
2
2 1 2
4 2 1

Sample Output

14

题意：给出n*m矩阵和ｐ中门的类型（最多１０种），其中有k个障碍，两坐标之间存在墙或门

给出s个钥匙位置及编号，相应的钥匙开相应的门（有可能同一个位置有多个钥匙）。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int d[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
const int maxn = 55 ;
const int N = 11 ;

struct node
{
    int x,y;
    int step,sta;
    node() {}
    node(int _x,int _y,int _step,int _sta): x(_x),y(_y),step(_step),sta(_sta) {}
};

bool visited[maxn][maxn][1<<N];
int a[maxn][maxn][maxn][maxn],key[maxn][maxn];
int n,m,p;

void initial()
{
    memset(visited,0,sizeof(visited));
    memset(a,-1,sizeof(a));
    memset(key,0,sizeof(key));
}

void input()
{
    int k,s,x,y,dx,dy,g;
    scanf("%d",&k);
    for(int i=0;i<k;i++)
    {
         scanf("%d %d %d %d %d",&x,&y,&dx,&dy,&g);
         a[x][y][dx][dy]=g;
         a[dx][dy][x][y]=g;
    }
    scanf("%d",&s);
    for(int i=0;i<s;i++)
    {
         scanf("%d %d %d",&x,&y,&g);
         int t=1<<(g-1);
         if((key[x][y] & t)==0)   key[x][y] = key[x][y] | t;
    }
}

bool judge(int xx,int yy)
{
    if(xx>=1 && xx<=n && yy>=1 && yy<=m)  return true;
    return false;
}

int bfs()
{
     queue <node> q;
     q.push(node(1,1,0,key[1][1]));
     visited[1][1][key[1][1]]=1;
     while(!q.empty())
     {
          node c=q.front(); q.pop();
          if(c.x==n && c.y==m)  return c.step;
          for(int i=0;i<4;i++)
          {
               int xx=c.x+d[i][0],yy=c.y+d[i][1],sp = c.sta | key[xx][yy];
               int t=a[c.x][c.y][xx][yy];
               int w=1<<(t-1);
               if(judge(xx,yy) && ((t==-1) || (t!=0 && (c.sta & w))) && !visited[xx][yy][sp])
               {
                   visited[xx][yy][sp]=1;
                   q.push(node(xx,yy,c.step+1,sp));
               }
          }
     }
     return -1;
}

int main()
{
    while(scanf("%d %d %d",&n,&m,&p)!=EOF)
    {
        initial();
        input();
        printf("%d\n",bfs());
    }
    return 0;
}

题意：给出n*m矩阵和ｐ中门的类型（最多１０种），其中有k个障碍，两坐标之间存在墙或门

给出s个钥匙位置及编号，相应的钥匙开相应的门（有可能同一个位置有多个钥匙）。