题解
我们可以根据题意得到,一个炮会打x形的地方,所以我们分开处理将正负对角线,减去重合的格子即可。再用前缀和优化一下复杂度就降到了O(n+m)
代码
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cctype>
#define N 1000005
#define ll long long
using namespace std;
ll a[N],b[N],ans,n,m;
inline ll read()
{
ll ret=0;char ch=getchar();
for (;!isdigit(ch);ch=getchar());
for (;isdigit(ch);ch=getchar()) ret=ret*10+ch-'0';
return ret;
}
int abs(int x){return x<0?-x:x;}
int main()
{
n=read(),m=read(),ans=n*n;
for (int i=1;i<=m;i++)
{
int x=read(),y=read();
a[x+y]=1,b[x-y+n]=1;
}
for (int i=2;i<=2*n;i++)
if (a[i]) ans-=n-abs(n+1-i);
for (int i=1;i<2*n;i++)
if (b[i]) ans-=n-abs(n-i);
for (int i=4;i<=2*n;i++) a[i]+=a[i-2];
for (int i=1;i<2*n;i++)
{
if (!b[i]) continue;
int x=abs(n-i);
ans+=a[2*n-x]-a[x];
}
printf("%lld\n",ans);
return 0;
}