【Codeforces944F】Game with Tokens

time limit per test：2 seconds
memory limit per test：256 megabytes
input：standard input
output：standard output

Description
Consider the following game for two players. There is one white token and some number of black tokens. Each token is placed on a plane in a point with integer coordinates x and y.

The players take turn making moves, white starts. On each turn, a player moves all tokens of their color by 1 to up, down, left or right. Black player can choose directions for each token independently.

After a turn of the white player the white token can not be in a point where a black token is located. There are no other constraints on locations of the tokens: positions of black tokens can coincide, after a turn of the black player and initially the white token can be in the same point with some black point. If at some moment the white player can’t make a move, he loses. If the white player makes 10100500 moves, he wins.

You are to solve the following problem. You are given initial positions of all black tokens. It is guaranteed that initially all these positions are distinct. In how many places can the white token be located initially so that if both players play optimally, the black player wins?

Input
The first line contains a single integer n (1 ≤ n ≤ 105) — the number of black points.

The (i + 1)-th line contains two integers xi, yi ( - 105 ≤ xi, yi,  ≤ 105) — the coordinates of the point where the i-th black token is initially located.

It is guaranteed that initial positions of black tokens are distinct.

Output
Print the number of points where the white token can be located initially, such that if both players play optimally, the black player wins.

Examples
input1

4
-2 -1
0 1
0 -3
2 -1

output1

4

input2

4
-2 0
-1 1
0 -2
1 -1

output2

2

input3

16
2 1
1 2
-1 1
0 1
0 0
1 1
2 -1
2 0
1 0
-1 -1
1 -1
2 2
0 -1
-1 0
0 2
-1 2

output3

4

Note
In the first and second examples initial positions of black tokens are shown with black points, possible positions of the white token (such that the black player wins) are shown with white points.

The first example:

..1..
..0..
10.01
..0..
..1..

let 1 take the place of black tokens and the white token can be lain at the 0 block
The second example:

.1..
10..
..01
..1.

In the third example the white tokens should be located in the inner square 2 × 2, to make the black player win.

......
.1111.
.1111.
.1111.
.1111.
......

---

题目大意

假设棋盘上有若干黑棋和一个白棋，每一轮白起先走到一个没放黑棋的四联通的位置，若四周都有黑棋则输，接下来黑棋每一子都要往前后左右一个方向走，可以与其它子重合，在最优策略下黑棋想要困住白棋
现在给出若干个黑棋的位置，问有多少个位置放白棋会输

---

Analysis
对于一颗黑棋和一颗白棋，若黑棋的横纵坐标之和与白棋的奇偶性相同，那么黑棋永远无法挡住白棋
若白棋朝黑棋走,黑棋也朝白棋走，否则按白棋的方向走

..1→    .←1.
....    .↑..
.0→.    .0..

这样，当且仅当白棋的以下四个方向上都有点才能被抓住

这样将棋盘旋转45度，就变成了扫描线的问题了

#include<cstring>
#include<cstdio>
#include<algorithm>
#define N 100100
#define bord 200000
#define fo(i,a,b) for(int i=a,E=b;i<=E;i++)
#define fd(i,a,b) for(int i=a,E=b;i>=E;i--)

using namespace std;

int n,mx[N*4],mn[N*4];
long long ans;
struct token{int x,y;}d[N];
bool cmp(token a,token b){return a.x<b.x;}

int main(){
    scanf("%d",&n);
    fo(i,1,n){
        int x,y;scanf("%d %d",&x,&y);
        d[i]=(token){x+y,x-y};
    }sort(d+1,d+n+1,cmp);
    int l[2],r[2],a=1;
    l[0]=l[1]=bord*2+2,r[0]=r[1]=-bord*2-2;
    fo(i,0,bord*2)mx[i]=l[0],mn[i]=r[0];
    fo(i,-bord,bord){
        int w=(i%2+2)&1;
        mn[i+bord]=max(mn[i+bord],l[1^w]);
        mx[i+bord]=min(mx[i+bord],r[1^w]);
        for(;a<=n && d[a].x==i;++a){
            l[w]=min(l[w],d[a].y);r[w]=max(r[w],d[a].y);
        }
    }
    l[0]=l[1]=bord*2+2,r[0]=r[1]=-bord*2-2;a=n;
    fd(i,bord,-bord){
        int w=(i%2+2)&1;
        mn[i+bord]=max(mn[i+bord],l[1^w]);
        mx[i+bord]=min(mx[i+bord],r[1^w]);
        for(;a && d[a].x==i;--a){
            l[w]=min(l[w],d[a].y);r[w]=max(r[w],d[a].y);
        }
    }
    fo(i,-bord,bord){
        int w=(i%2+2)&1;
        if((mn[i+bord]%2+2)%2!=w)++mn[i+bord];
        if((mx[i+bord]%2+2)%2!=w)--mx[i+bord];
        if(mx[i+bord]>=mn[i+bord])ans+=(mx[i+bord]-mn[i+bord])/2+1;
    }printf("%I64d",ans);
    return 0;
}