WA 84

#include <bits/stdc++.h>
using namespace std;
int n,m,p,k,s,a,b,c,d,e,nx,ny,mp[15][15][4],key[15][15],dx[4] = {-1,0,1,0},dy[4] = {0,1,0,-1};
map <int,bool> vis[15][15];
struct Node{int x,y,t,stm;};
queue <Node> q;
void bfs()
{
	while(!q.empty())
	{
		a = q.front().x,b = q.front().y,c = q.front().t,d = q.front().stm;
		q.pop();
		for(int i = 0;i < 4;i++)
		{
			if(mp[a][b][i] == -1) continue;
			if(mp[a][b][i] && !(d & (1 << (mp[a][b][i] - 1)))) continue;
			nx = a + dx[i],ny = b + dy[i];
			e = (d | (1 << (key[nx][ny] - 1)));
			if(nx < 1 || nx > n || ny < 1 || ny > m) continue;
			if(vis[nx][ny][e]) continue;
			if(nx == n && ny == m)
			{
				printf("%d\n",c + 1);
				return ;
			}
			vis[nx][ny][e] = true;
			q.push((Node){nx,ny,c + 1,e});
		}
	}
	printf("-1\n");
}
int main()
{
	scanf("%d%d%d",&n,&m,&p);
	scanf("%d",&k);
	for(int i = 1;i <= k;i++)
	{
		scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
		if(e == 0) e = -1;
		if(c == a - 1)
		{
			mp[a][b][0] = e;
			mp[c][d][2] = e;
		}
		if(c == a + 1)
		{
			mp[a][b][2] = e;
			mp[c][d][0] = e;
		}
		if(b == d - 1)
		{
			mp[a][b][1] = e;
			mp[c][d][3] = e;
		}
		if(b == d + 1)
		{
			mp[a][b][3] = e;
			mp[c][d][1] = e;
		}
	}
	scanf("%d",&s);
	for(int i = 1;i <= s;i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		key[a][b] = c;
	}
	if(n == 1 && m == 1) printf("0\n");
	else
	{
		if(key[1][1]) q.push((Node){1,1,0,1 << (key[1][1] - 1)});
		else q.push((Node){1,1,0,0});
		bfs();
	}
	return 0;
}