P1789 [MC survival] torch [introduction]

【Mc Existence 】 Insert a torch

Title Description

Say one day linyorson stay “ My world ” Opened one $n\times n$ Matrix of , Now he has $m$ A torch and $k$ A fluorite , We separate $(x_1,y_1)\sim (x_m,y_m)$ and $(o_1,p_1)\sim (o_k,p_k)$ The location of , There are monsters where there is no light or nothing . How many points in this square array will generate monsters ？

P.S. The scope of the torch is ：

    | dark | dark |  light  | dark | dark |
    | dark | light |  light  | light | dark |
    | light | light | Torch | light | light |
    | dark | light |  light  | light | dark |
    | dark | dark |  light  | dark | dark |

Fluorite ：

    | light | light |  light  | light | light |
    | light | light |  light  | light | light |
    | light | light | Fluorite | light | light |
    | light | light |  light  | light | light |
    | light | light |  light  | light | light |

Input format

Input common $m+k+1$ That's ok .
First act $n,m,k$.
The first $2$ To the first $m+1$ OK, the positions of the torches $x_i,y_i$.
The first $m+2$ To the first $m+k+1$ The lines are the positions of fluorite $o_i,p_i$.

notes ： Maybe no fluorite , But there must be a torch .

Output format

There are a few points that produce monsters .

Examples #1

The sample input #1

5 1 0
3 3

Sample output #1

12

Tips

Data assurance ,$1\le n\le 100$,$1\le m+k\le 25$,$1\le m\le 25$,$0\le k\le 5$.

Ideas ： It's a simulation problem .

At the input point 5*5 Within the scope of , Take the input point as the center point , If it is fluorite, it will be illuminated , If it is a torch, it is the sum of the absolute values of the coordinates <=2 The position of is illuminated .
And these points should be in 1 To n Between , Array cannot be out of bounds .

#include<iostream>
#include<vector>
#include<string>
#include<sstream>
#include<queue>
#include<stack>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int a[101][101]={
    0},n;

bool Init(int x,int y){
    
    return x<=0||y<=0||x>n||y>n ? false : true;
}

int main(){
    
    cin>>n;
    int m,k,x1,y1,he=0;
    cin>>m>>k;
    for(int i=1;i<=m+k;++i){
    
        cin>>x1>>y1;
        for(int x=-2;x<=2;++x){
    
            for(int y=-2;y<=2;++y){
    
                if((i>m||abs(x)+abs(y)<=2)&&Init(x+x1,y+y1))
                    a[x+x1][y+y1]++;
            }
        }
    }
    for(int i=1;i<=n;++i){
    
        for(int j=1;j<=n;++j)
            he+=(a[i][j]==0);
    }
    cout<<he<<endl;
    return 0;
}