406 “Z”型矩阵 思维+树状数组 [代码源][namomo spring camp]每日一题div1

Educational Codeforces Round 8
E. Zbazi in Zeydabad
codeforces题目链接
一道CF的E题

晚点补文字，先给代码

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%lld",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define sr4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d);
#define f(i,a,n) for(int i=a;i<=n;i++)
#define ff(i) for(int i=1;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
//#define int __int128
#define pii pair<int,int>
#define int long long
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define dd double
#define inf 0x3f3f3f3f
#define ll __int128
#define fi first
#define se second
using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
const int N=3e3+5;
//树状数组维护当前对角线（二维数点）
//从后向前加入树状数组
int r[N][N],l[N][N],lz[N][N];
vector<pii>v[N];
int n,m;
int tree[N<<1][N];
int ask(int k,int x)
{
	int ans=0;
	for(;x;x-=x&-x)ans+=tree[k][x];
	return ans;
}
void add(int k,int x,int val)
{
	for(;x<=m;x+=x&-x)tree[k][x]+=val;
}
char a[N][N];
void init()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		scanf("%s",a[i]+1);
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(a[i][j]=='z')l[i][j]=l[i][j-1]+1;
			else l[i][j]=0; 
		}
		for(int j=m;j>=1;j--)
		{
			if(a[i][j]=='z')r[i][j]=r[i][j+1]+1;
			else r[i][j]=0;
		}
		for(int j=1;j<=m;j++)
		{
			if(a[i][j]=='z')v[j+r[i][j]-1].push_back(mk(i,j));
		}
	}
	for(int i=n;i>=1;i--)
		for(int j=1;j<=m;j++)
		if(a[i][j]=='z')lz[i][j]=lz[i+1][j-1]+1;
		else lz[i][j]=0;
}

inline void solve()
{
	init();
	int ans=0;
	for(int j=m;j>=1;j--)
	{
		for(int i=0;i<v[j].size();i++)
		{
			add(v[j][i].fi+v[j][i].se,v[j][i].se,1);
		}
		for(int i=1;i<=n;i++)
		{
			if(a[i][j]=='z')
			{
				int c=min(l[i][j],lz[i][j]);
				ans+=ask(i+j,j)-ask(i+j,j-c);
			}
		}
	}
	printf("%lld\n",ans);
	return;
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	// cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<< "Time used:" << clock() - c1 << endl;
	return 0;
}