提出 #49004169

---

ソースコード 拡げる

// LUOGU_RID: 141826550
//Author: gsczl71
//Copyright (c) 2023 gsczl71 All rights reserved.

#include<bits/stdc++.h>
#define ll long long
#define i128 __int128
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fir first
#define se second
#define endl '\n'
#define debug puts("AK IOI")
#define re register
#define pb push_back
using namespace std;
#define int long long
const int mod = 1e9+7;
//const int mod = 998244353;
const int inf = 0x3f3f3f3f,N = 25,M = 2e5+5;
const ll linf = 0x3f3f3f3f3f3f3f3f;
int n;
int a[N][N];
map<int,int> mp[N][N];int ans=0;
void dfs1(int x,int y,int val){
	val ^= a[x][y];
	if(x+y==n+1) return mp[x][y][val]++,void();
	if(x<=n) dfs1(x+1,y,val);
	if(y<=n) dfs1(x,y+1,val);
}void dfs2(int x,int y,int val){
	if(x+y==n+1) return ans+=mp[x][y][val],void();
	val ^= a[x][y];
	if(x>=1) dfs2(x-1,y,val);
	if(y>=1) dfs2(x,y-1,val);
}void solve(){
	cin>>n;
	for(int i = 1;i <= n;i++)for(int j = 1;j <= n;j++)cin>>a[i][j];
	dfs1(1,1,0);dfs2(n,n,0);cout<<ans;
}
signed main(){
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int T=1;
//	cin >> T;
	while(T--) solve();
	return 0;
}

提出情報

ジャッジ結果