[GXOI/GZOI2019]与或和

[GXOI/GZOI2019]与或和

解析：

首先我们分位考虑，对于二进制第i位，AND所产生的贡献为2^i*该位所构成的01矩阵中的全为1的子矩阵的个数,OR所产生的贡献为2^i*该位所构成的01矩阵中有1的子矩阵的个数

对于上述化简后的问题，我们只需要单调栈就行了

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1e9+7;
const int N=1010;
int a[N][N],b[N][N],sta[N],f[2][N][N],pos[N];
ll s[N];
ll ans_or,ans_and;
int n;
void find_and(ll x)
{
	ll ans=0;
     for (int j=1;j<=n;j++)
     {
     	int k=0; 
     	for (int i=1;i<=n;i++) 
         {
         	while (k&&f[1][i][j]<=sta[k]) {k--;}
         	sta[++k]=f[1][i][j]; pos[k]=i;
         	s[k]=(s[k-1]+(ll)(i-pos[k-1])*f[1][i][j]%mod)%mod;
         	ans=(ans+s[k])%mod; 
         }
     }
     ans_and=(ans_and+x*ans%mod)%mod;
}
void find_or(ll x)
{
     ll ans=0;
     for (int j=1;j<=n;j++)
     {
     	int k=0;
     	for (int i=1;i<=n;i++) 
     	{
            while (k&&f[0][i][j]<=sta[k]) {k--;}
            sta[++k]=f[0][i][j]; pos[k]=i;
            s[k]=(s[k-1]+(ll)(i-pos[k-1])*f[0][i][j]%mod)%mod;
            ans=(ans-s[k]+mod)%mod; 
            ans=(ans+(ll)i*j%mod)%mod; 
     	}
     }
     ans_or=(ans_or+x*ans%mod)%mod;
}
int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++) {
		for (int j=1;j<=n;j++) scanf("%d",&b[i][j]);
	}
    for (int k=0;k<31;k++)
    {  
    for (int i=1;i<=n;i++) 
      for (int j=1;j<=n;j++) a[i][j]=(b[i][j]&1),b[i][j]>>=1;
    for (int i=1;i<=n;i++) 
     {
     	for (int j=1;j<=n;j++) 
             if (a[i][j]==1) f[1][i][j]=f[1][i][j-1]+1; else f[1][i][j]=0;
     }
    for (int i=1;i<=n;i++) {
    	for (int j=1;j<=n;j++) 
    		 if (a[i][j]==0) f[0][i][j]=f[0][i][j-1]+1; else f[0][i][j]=0;
    }    	
    find_and(1<<k);
    find_or(1<<k);
    }
    cout << ans_and << ' ' << ans_or << endl;
}