One question per day, a classic simulation question

Background

The first party of junior high school should know ......

Title Description

Say one day linyorson stay “ My world ” Opened one  n \times nn×n（n \le 100n≤100） Matrix of , Now he has  mm  A torch and  kk  A fluorite , We separate  (x_1, y_1) \sim (x_m, y_m)(x1​,y1​)∼(xm​,ym​)  and  (o_1, p_1) \sim (o_k, p_k)(o1​,p1​)∼(ok​,pk​)  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 + 1m+k+1  That's ok .
First act  n, m, kn,m,k.
The first  22  To the first  m + 1m+1  OK, the positions of the torches  x_i, y_ixi​,yi​.
The first  m + 2m+2  To the first  m + k + 1m+k+1  The lines are the positions of fluorite  o_i, p_ioi​,pi​.

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

All data is guaranteed in  int  Within the scope of .

Output format

There are a few points that produce monsters .

I/o sample

Input #1 Copy

5 1 0
3 3

Output #1 Copy

12

Code section , Meter printing plus simulation

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
    int n=0,m=0,k=0;
    scanf("%d %d %d",&n,&m,&k);
    int a[n+5][n+5]={0};
    while(m--)
    {
        int x=0,y=0;
        scanf("%d %d",&x,&y);
        a[x-2][y]=1; a[x-1][y]=1; a[x][y]=1; a[x+1][y]=1;a[x+2][y]=1;
        a[x][y-2]=1; a[x][y-1]=1;a[x][y+1]=1;a[x][y+2]=1;
        a[x-1][y-1]=1; a[x-1][y+1]=1; a[x+1][y-1]=1; a[x+1][y+1]=1;
    }
    while(k--)
    {
        int x=0,y=0;
        scanf("%d %d",&x,&y);
        for(int i=x-2;i<=x+2;i++)
        {
            for(int j=y-2;j<=y+2;j++)
            {
                a[i][j]=1;
            }
        }
    }
    int all=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(a[i][j]==0)
            all++;
        }
    }
    printf("%d\n",all);
    return 0;
}