Untitled

#include<iostream>
using namespace std;


int t, m, n, a[51][51], p, r, c, cnt, ploang;
int front , rear,q1[51 * 51] , q2[51 * 51], visited[51][51];

int dx[] = {-1,0,1,0};
int dy[] = {0, 1,0,-1};


//bool ket_noi[8][4] = 
//{
//	{0, 0, 0, 0},
//	{1, 1, 1, 1},
//	{1, 0, 1, 0},
//	{0, 1, 0, 1},
//	{1, 1, 0, 0},
//	{0, 1, 1, 0},
//	{0, 0, 1, 1},
//	{1, 0, 0, 1}
//};



void BFS(int x, int y)
{
	q1[++rear] = x;
	q2[rear] = y;

	int b = 0, c = 0;
	while (front != rear)
	{
		int u = q1[++front];
		int v = q2[front];
		b = a[u][v];
		if(visited[u][v] == p)
			break;

		for (int k = 0; k < 4; k++)
		{
			/*if(!ket_noi[a[u][v]][k])
				continue;*/

			int tx = u + dx[k];
			int ty = v + dy[k];
			c = a[tx][ty];
			if( tx < 0 || tx == n || ty < 0 || ty == m || !a[tx][ty] || visited[tx][ty] )
				continue;
			
	//		int check = noi_ong(u, v, tx , ty);
		
				if(k == 0 &&  b == 1 || b == 2 || b == 4 || b == 7 && c ==1 || c == 2 || c == 5 || c == 6)
				{
					visited[tx][ty] = visited[u][v] + 1;
					q1[++rear] = tx;
					q2[rear] = ty;
					cnt++;
				}
				else if(k == 1 && b == 1 ||| b == 3|| b == 4 || b == 5 && c == 1 || c == 3 || c == 6 || c == 7)
				{
					visited[tx][ty] = visited[u][v] + 1;
					q1[++rear] = tx;
					q2[rear] = ty;
					cnt++;
				}
				else if( k == 2 && b == b == 1 || b == 2 || b == 5 || b == 6 && c == 1 || c == 2 || c == 4 || c == 7)
				{
					visited[tx][ty] = visited[u][v] + 1;
					q1[++rear] = tx;
					q2[rear] = ty;
					cnt++;
				}
				else if( k == 3 && b == 1 || b == 3 || b == 6 || b == 7 && c == 1 || c == 3 || c == 6 || c == 7)
				{
					visited[tx][ty] = visited[u][v] + 1;
					q1[++rear] = tx;
					q2[rear] = ty;
					cnt++;
				}
				else
					continue;
	
		}
		
	}


}


int main()
{
	//freopen("t.txt", "r", stdin);
	cin >> t;
	for (int tc = 1; tc <= t; tc++)
	{
		cin >> m >> n >> r >> c >> p;

			for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> a[i][j];
			visited[i][j] = 0;
		}
	}

	cnt = 1;
	visited[r][c] = 1;
	front = -1;
	rear = -1 ;

	BFS(r, c);
	cout <<"Case #" << tc << endl<< cnt << endl;


	}

	return 0;

}