XOR on Grid Path abc271F 双向bfs

题面https://atcoder.jp/contests/abc271/tasks/abc271_f

#pragma GCC optimize(3,"Ofast","inline")
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
ll n,s,a[25][25],i,j;
map<ll,ll>b[25];
void p1(ll x,ll y,ll t){
	if(x+y==n+1)b[x][t]++;
	else p1(x+1,y,t^a[x+1][y]),p1(x,y+1,t^a[x][y+1]);
}
void p2(ll x,ll y,ll t){
	if(x+y==n+1)s+=b[x][t];
	else t^=a[x][y],p2(x-1,y,t),p2(x,y-1,t);
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)for(j=1;j<=n;j++)cin>>a[i][j];
	p1(1,1,a[1][1]);p2(n,n,0ll);
	cout<<s<<'\n';
	return 0;
}