Xor-Paths

最新推荐文章于 2022-04-14 15:19:39 发布

zhengde152

最新推荐文章于 2022-04-14 15:19:39 发布

阅读量335

点赞数

CC 4.0 BY-SA版权

分类专栏： BFS

本文链接：https://blog.csdn.net/zhengde152/article/details/84917858

BFS 专栏收录该内容

3 篇文章

订阅专栏

本文探讨了在一个矩阵中寻找从左上角到右下角的路径，路径上的数字异或和等于特定值的问题。通过双端深度优先搜索（DFS）算法，结合哈希表记录中间状态，有效地解决了这一挑战。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

There is a rectangular grid of size n×mn×m. Each cell has a number written on it; the number on the cell (i,ji,j) is ai,jai,j. Your task is to calculate the number of paths from the upper-left cell (1,11,1) to the bottom-right cell (n,mn,m) meeting the following constraints:

You can move to the right or to the bottom only. Formally, from the cell (i,ji,j) you may move to the cell (i,j+1i,j+1) or to the cell (i+1,ji+1,j). The target cell can't be outside of the grid.
The xor of all the numbers on the path from the cell (1,11,1) to the cell (n,mn,m) must be equal to kk (xor operation is the bitwise exclusive OR, it is represented as '^' in Java or C++ and "xor" in Pascal).

Find the number of such paths in the given grid.

Input

The first line of the input contains three integers nn, mm and kk (1≤n,m≤201≤n,m≤20, 0≤k≤10180≤k≤1018) — the height and the width of the grid, and the number kk.

The next nn lines contain mm integers each, the jj-th element in the ii-th line is ai,jai,j(0≤ai,j≤10180≤ai,j≤1018).

Output

Print one integer — the number of paths from (1,11,1) to (n,mn,m) with xor sum equal to kk.

Examples

Input

Output

Input

Output

Input

3 4 1000000000000000000
1 3 3 3
0 3 3 2
3 0 1 1

Output

Note

All the paths from the first example:

(1,1)→(2,1)→(3,1)→(3,2)→(3,3)(1,1)→(2,1)→(3,1)→(3,2)→(3,3);
(1,1)→(2,1)→(2,2)→(2,3)→(3,3)(1,1)→(2,1)→(2,2)→(2,3)→(3,3);
(1,1)→(1,2)→(2,2)→(3,2)→(3,3)(1,1)→(1,2)→(2,2)→(3,2)→(3,3).

All the paths from the second example:

(1,1)→(2,1)→(3,1)→(3,2)→(3,3)→(3,4)(1,1)→(2,1)→(3,1)→(3,2)→(3,3)→(3,4);
(1,1)→(2,1)→(2,2)→(3,2)→(3,3)→(3,4)(1,1)→(2,1)→(2,2)→(3,2)→(3,3)→(3,4);
(1,1)→(2,1)→(2,2)→(2,3)→(2,4)→(3,4)(1,1)→(2,1)→(2,2)→(2,3)→(2,4)→(3,4);
(1,1)→(1,2)→(2,2)→(2,3)→(3,3)→(3,4)(1,1)→(1,2)→(2,2)→(2,3)→(3,3)→(3,4);
(1,1)→(1,2)→(1,3)→(2,3)→(3,3)→(3,4)(1,1)→(1,2)→(1,3)→(2,3)→(3,3)→(3,4).

题解：大意是从左上角（1,1）开始到右下角（n,m）只能往左或往下走的异或值为K的路径有多少条。

用两个dfs去搜，一个从前面搜到一半,即x+y==max(n,m),另一个·从后面倒着搜,搜到一半，即x+y==max(n,m)+1;在搜的过程中异或一下num[i][j]，用map标记一下到各点异或值的个数，累加起来就可以了。

代码：

#include<stdio.h>
#include<string.h>
#include<map>
#include<algorithm>
#define ll long long
using namespace std;
map<ll,ll>mp[30][30];
int n,m,t;
ll k,num[30][30],ans;
// 双端dfs , 一个 从 （1,1）到（i,j）且 i+j==max（n,m）

void dfs1(int x,int y,ll tt)
{
	if(x+y==t)
	{
		mp[x][y][tt]++;  //用map记录搜到点（y,x）处时，值为tt的个数
		return ;
	}
	if(x+1<=n)
	   dfs1(x+1,y,tt^num[x+1][y]);
	if(y+1<=m)
	   dfs1(x,y+1,tt^num[x][y+1]);
}
// 第二个 从（n，m）到 （i，j） 且（i+j）==max(n,m)+1
void dfs2(int x,int y,ll tt)
{
	if(x+y==t+1)
	{
		if(x-1>=1)
			ans+=mp[x-1][y][tt^k];
		if(y-1>=1)
		    ans+=mp[x][y-1][tt^k];
		return ;
	}
	if(x-1>=1)
	  dfs2(x-1,y,tt^num[x-1][y]);
	if(y-1>=1)
	  dfs2(x,y-1,tt^num[x][y-1]);
}
int main()
{
	while(~scanf("%d%d%lld",&n,&m,&k))
	{
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
		    	mp[i][j].clear();
		 	  scanf("%lld",&num[i][j]);
			}
		}
		ans=0;
		t=max(n,m);
		if(1+1<=t)
		{
			dfs1(1,1,num[1][1]);
			dfs2(n,m,num[n][m]);
		}
		else
		{
			if(num[1][1]==k)
			 ans++; 
		}
		printf("%lld\n",ans);
	}
}