Problem:


Score : 400 points

Problem Statement

We have a grid with H rows and W columns. At first, all cells were painted white.

Snuke painted N of these cells. The i-th ( 1 \leq i \leq N ) cell he painted is the cell at the a_i-th row and b_i-th column.

Compute the following:

For each integer j ( 0 \leq j \leq 9 ), how many subrectangles of size 3×3 of the grid contains exactly j black cells, after Snuke painted N cells?

Constraints

3 \leq H \leq 10^9

3 \leq W \leq 10^9

0 \leq N \leq min(10^5,H×W)

1 \leq a_i \leq H (1 \leq i \leq N)

1 \leq b_i \leq W (1 \leq i \leq N)

(a_i, b_i) \neq (a_j, b_j) (i \neq j)

Input

The input is given from Standard Input in the following format:

H W N
a_1 b_1
:
a_N b_N

Output

Print 10 lines.
The (j+1)-th ( 0 \leq j \leq 9 ) line should contain the number of the subrectangles of size 3×3 of the grid that contains exactly j black cells.

Sample Input 1

4 5 8
1 1
1 4
1 5
2 3
3 1
3 2
3 4
4 4

Sample Output 1

0
0
0
2
4
0
0
0
0
0

There are six subrectangles of size 3×3. Two of them contain three black cells each, and the remaining four contain four black cells each.

Sample Input 2

10 10 20
1 1
1 4
1 9
2 5
3 10
4 2
4 7
5 9
6 4
6 6
6 7
7 1
7 3
7 7
8 1
8 5
8 10
9 2
10 4
10 9

Sample Output 2

4
26
22
10
2
0
0
0
0
0

Sample Input 3

1000000000 1000000000 0

Sample Output 3

999999996000000004
0
0
0
0
0
0
0
0
0



Sample input:
4 5 8
1 1
1 4
1 5
2 3
3 1
3 2
3 4
4 4


Sample output:
0
0
0
2
4
0
0
0
0
0

Submission status: Wrong Answer

Solution code:
from collections import Counter

h, w, n = map(int, input().split())
a_list = [0 for _ in range((w - 2) * (h - 2))]
for _ in range(n):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    for a_i in range(a - 2, a + 1):
        for b_i in range(b - 2, b + 1):
            if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):
                a_list[(b_i * (h - 2)) + a_i] += 1

k = Counter(a_list)
a_0 = ((h - 2) * (w - 2)) - sum(k.values())
for i in range(10):
    if i == 0:
        print(a_0)
    else:
        if i in k.keys():
            print(k[i])
        else:
            print(0)

Submission status: Wrong Answer

Solution code:
from collections import Counter

h, w, n = map(int, input().split())
a_list = [[0 for _ in range(w)] for _ in range(h)]
triangle = []
for _ in range(n):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    for a_i in range(a - 1, a + 2):
        for b_i in range(b - 1, b + 2):
            if (1 <= a_i < h - 1) & (1 <= b_i < w - 1):
                triangle.append(str(a_i) + "_" + str(b_i))
aaa = Counter(triangle).values()
dp = [0 for _ in range(10)]
total = 0
for i in aaa:
    dp[i] += 1
    total += i
dp[0] = ((h - 2) * (w - 2)) - total
for i in dp:
    print(i)

Submission status: Wrong Answer

Solution code:
from collections import Counter

h, w, n = map(int, input().split())
a_list = [[0 for _ in range(w)] for _ in range(h)]
triangle = []
for _ in range(n):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    for a_i in range(a - 1, a + 2):
        for b_i in range(b - 1, b + 2):
            if (1 <= a_i < h - 1) & (1 <= b_i < w - 1):
                triangle.append(str(a_i) + "_" + str(b_i))
aaa = Counter(list(Counter(triangle).values()))
for i in range(10):
    if i in aaa.keys():
        print(aaa[i])
    if i == 0:
        print((h - 2) * (w - 2) -  sum(aaa.values()))
    else:
        print(0)

Submission status: Wrong Answer

Solution code:
from collections import Counter

h, w, n = map(int, input().split())
a_list = [[0 for _ in range(w)] for _ in range(h)]
triangle = []
for _ in range(n):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    for a_i in range(a - 1, a + 2):
        for b_i in range(b - 1, b + 2):
            if (1 <= a_i < h - 1) & (1 <= b_i < w - 1):
                triangle.append(str(a_i) + "_" + str(b_i))
aaa = Counter(list(Counter(triangle).values()))
for i in range(10):
    if i in aaa.keys():
        print(aaa[i])
    if i == 0:
        print((h - 2) * (w - 2) -  sum(aaa))
    else:
        print(0)

Submission status: Wrong Answer

Solution code:
from collections import Counter

h, w, n = map(int, input().split())
a_list = [[0 for _ in range(w)] for _ in range(h)]
triangle = []
for _ in range(n):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    for a_i in range(a - 1, a + 2):
        for b_i in range(b - 1, b + 2):
            if (1 <= a_i < h - 1) & (1 <= b_i < w - 1):
                triangle.append(str(a_i) + "_" + str(b_i))
aaa = Counter(list(Counter(triangle).values()))
for i in range(10):
    if i in aaa.keys():
        print(aaa[i])
    else:
        print(0)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

H,W,N=map(int,input().split())
ab=[tuple(map(int,input().split())) for i in range(N)]
ab.sort()

r_b=[0]

r_b_app=r_b.append
for i in range(1,N):
  if ab[i][0]!=ab[i-1][0]:
    r_b_app(i)

if N>0:
  r_b_app(N)
rows=tuple(ab[b][0] for b in r_b if b<N)

cols=tuple(tuple(ab[j][1] for j in range(r_b[i],r_b[i+1])) for i in range(len(r_b)-1))

rN=len(cols)


ched_box0=[[[False]*3 for k in range(3)] for j in range((len(cols[0]) if 0<rN else 0))]
ched_box1=[[[False]*3 for k in range(3)] for j in range((len(cols[1]) if 1<rN else 0))]
ched_box2=[[[False]*3 for k in range(3)] for j in range((len(cols[2]) if 2<rN else 0))]

dic_cn0=dict(zip(cols[0],list(range(len(cols[0]))))) if 0<rN else {}
dic_cn1=dict(zip(cols[1],list(range(len(cols[1]))))) if 1<rN else {}
dic_cn2=dict(zip(cols[2],list(range(len(cols[2]))))) if 2<rN else {}

area_n=[0]*9

count=[[1]*3 for i in range(3)]
find_cn=[0]*12

for rn in range(rN):
  cN=len(cols[rn])
  row=rows[rn]

  if rn!=0:
    ched_box0=ched_box1
    dic_cn0=dic_cn1
    ched_box1=ched_box2
    dic_cn1=dic_cn2
    if rn<rN-2:
      cN2_range=range(len(cols[rn+2]))
      ched_box2=[[[False]*3 for k in range(3)] for j in cN2_range]
      dic_cn2=dict(zip(cols[rn+2],list(cN2_range)))

  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
    ched_box=ched_box0[cn]
    
    box_row_0_cols=[]
    box_row_1_cols=[]
    box_row_2_cols=[]
    
    for box_col in range(3):
      if not ched_box[0][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-2>=1 and row<=H:
          box_row_0_cols.append(box_col)
        else:
          ched_box[0][box_col]=True
      if not ched_box[1][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-1>=1 and row+1<=H:
          box_row_1_cols.append(box_col)
        else:
          ched_box[1][box_col]=True
      if not ched_box[2][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row>=1 and row+2<=H:
          box_row_2_cols.append(box_col)
        else:
          ched_box[2][box_col]=True
 
    
      
    find_rowcol=[]

    find_rowcol_app=find_rowcol.append
    find_cn_n=0

    if (col+1 in dic_cn0 if col+1<=W else False):
      find_rowcol_app((row,col+1))
      find_cn[find_cn_n]=dic_cn0[col+1]
      find_cn_n+=1
    if (col+2 in dic_cn0 if col+2<=W else False):
      find_rowcol_app((row,col+2))
      find_cn[find_cn_n]=dic_cn0[col+2]
      find_cn_n+=1
    if (row1<=H if row1 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn1:
          find_rowcol_app((row1,ch_col))
          find_cn[find_cn_n]=dic_cn1[ch_col]
          find_cn_n+=1
    if (row2<=H if row2 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn2:
          find_rowcol_app((row2,ch_col))
          find_cn[find_cn_n]=dic_cn2[ch_col]
          find_cn_n+=1

        
    for i,(find_row,find_col) in enumerate(find_rowcol):
      
      if find_row is row:
        ch_rn=0
        ch_cn=find_cn[i]
      elif find_row is row1:
        ch_rn=1
        ch_cn=find_cn[i]
      elif find_row is row2:
        ch_rn=2
        ch_cn=find_cn[i]
      box_row_min=find_row-row
      box_col_min=max(find_col-col,0)
      box_col_max=min(3,3+find_col-col)
      
      if box_row_min==0 and len(box_row_0_cols):
        for box_col in range(max(box_col_min,min(box_row_0_cols)),min(box_col_max,1+max(box_row_0_cols))):
          count[0][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][0][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][0][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][0][box_col-find_col+col]=True

      if box_row_min<=1 and len(box_row_1_cols): 
        for box_col in range(max(box_col_min,min(box_row_1_cols)),min(box_col_max,1+max(box_row_1_cols))):
          count[1][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][1-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][1-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][1-box_row_min][box_col-find_col+col]=True

      if len(box_row_2_cols):
        for box_col in range(max(box_col_min,min(box_row_2_cols)),min(box_col_max,1+max(box_row_2_cols))):
          count[2][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][2-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][2-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][2-box_row_min][box_col-find_col+col]=True



            
    for box_col in box_row_0_cols:
      box_row=0
      area_n[count[box_row][box_col]-1]+=1
      count[box_row][box_col]=1
    for box_col in box_row_1_cols:
      box_row=1
      area_n[count[box_row][box_col]-1]+=1
      count[box_row][box_col]=1
    for box_col in box_row_2_cols:
      box_row=2
      area_n[count[box_row][box_col]-1]+=1
      count[box_row][box_col]=1     



print((W-2)*(H-2)-sum(area_n))
for i in range(9):
  print(area_n[i])
  
a=1
b=a
print(id(a),id(b))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

H,W,N=map(int,input().split())
ab=[tuple(map(int,input().split())) for i in range(N)]
ab.sort()

r_b=[0]

r_b_app=r_b.append
for i in range(1,N):
  if ab[i][0]!=ab[i-1][0]:
    r_b_app(i)

if N>0:
  r_b_app(N)
rows=tuple(ab[b][0] for b in r_b if b<N)

cols=tuple(tuple(ab[j][1] for j in range(r_b[i],r_b[i+1])) for i in range(len(r_b)-1))

rN=len(cols)


ched_box0=[[[False]*3 for k in range(3)] for j in range((len(cols[0]) if 0<rN else 0))]
ched_box1=[[[False]*3 for k in range(3)] for j in range((len(cols[1]) if 1<rN else 0))]
ched_box2=[[[False]*3 for k in range(3)] for j in range((len(cols[2]) if 2<rN else 0))]

dic_cn0=dict(zip(cols[0],list(range(len(cols[0]))))) if 0<rN else {}
dic_cn1=dict(zip(cols[1],list(range(len(cols[1]))))) if 1<rN else {}
dic_cn2=dict(zip(cols[2],list(range(len(cols[2]))))) if 2<rN else {}

area_n=[0]*9

count=[[1]*3 for i in range(3)]
find_cn=[0]*12

for rn in range(rN):
  cN=len(cols[rn])
  row=rows[rn]

  if rn!=0:
    ched_box0=ched_box1
    dic_cn0=dic_cn1
    ched_box1=ched_box2
    dic_cn1=dic_cn2
    if rn<rN-2:
      cN2_range=range(len(cols[rn+2]))
      ched_box2=[[[False]*3 for k in range(3)] for j in cN2_range]
      dic_cn2=dict(zip(cols[rn+2],list(cN2_range)))

  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
    ched_box=ched_box0[cn]
    
    box_row_0_cols=[]
    box_row_1_cols=[]
    box_row_2_cols=[]
    
    for box_col in range(3):
      if not ched_box[0][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-2>=1 and row<=H:
          box_row_0_cols.append(box_col)
        else:
          ched_box[0][box_col]=True
      if not ched_box[1][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-1>=1 and row+1<=H:
          box_row_1_cols.append(box_col)
        else:
          ched_box[1][box_col]=True
      if not ched_box[2][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row>=1 and row+2<=H:
          box_row_2_cols.append(box_col)
        else:
          ched_box[2][box_col]=True
 
    
      
    find_rowcol=[]

    find_rowcol_app=find_rowcol.append
    find_cn_n=0

    if (col+1 in dic_cn0 if col+1<=W else False):
      find_rowcol_app((row,col+1))
      find_cn[find_cn_n]=dic_cn0[col+1]
      find_cn_n+=1
    if (col+2 in dic_cn0 if col+2<=W else False):
      find_rowcol_app((row,col+2))
      find_cn[find_cn_n]=dic_cn0[col+2]
      find_cn_n+=1
    if (row1<=H if row1 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn1:
          find_rowcol_app((row1,ch_col))
          find_cn[find_cn_n]=dic_cn1[ch_col]
          find_cn_n+=1
    if (row2<=H if row2 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn2:
          find_rowcol_app((row2,ch_col))
          find_cn[find_cn_n]=dic_cn2[ch_col]
          find_cn_n+=1

        
    for i,(find_row,find_col) in enumerate(find_rowcol):
      
      if find_row is row:
        ch_rn=0
        ch_cn=find_cn[i]
      elif find_row is row1:
        ch_rn=1
        ch_cn=find_cn[i]
      elif find_row is row2:
        ch_rn=2
        ch_cn=find_cn[i]
      box_row_min=find_row-row
      box_col_min=max(find_col-col,0)
      box_col_max=min(3,3+find_col-col)
      
      if box_row_min==0 and len(box_row_0_cols):
        box_row=0
        for box_col in range(max(box_col_min,min(box_row_0_cols)),min(box_col_max,1+max(box_row_0_cols))):
          count[box_row][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][box_row-box_row_min][box_col-find_col+col]=True

      if box_row_min<=1 and len(box_row_1_cols): 
        box_row=1
        for box_col in range(max(box_col_min,min(box_row_1_cols)),min(box_col_max,1+max(box_row_1_cols))):
          count[box_row][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][box_row-box_row_min][box_col-find_col+col]=True

      if len(box_row_2_cols):
        box_row=2
        one=1
        for box_col in range(max(box_col_min,min(box_row_2_cols)),min(box_col_max,one+max(box_row_2_cols))):
          count[box_row][box_col]+=one
          if ch_rn is 0:
            ched_box0[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][box_row-box_row_min][box_col-find_col+col]=True



            
    for box_col in box_row_0_cols:
      area_n[count[0][box_col]-1]+=1
      count[0][box_col]=1
    for box_col in box_row_1_cols:
      area_n[count[1][box_col]-1]+=1
      count[1][box_col]=1
    for box_col in box_row_2_cols:
      area_n[count[2][box_col]-1]+=1
      count[2][box_col]=1
      
          



print((W-2)*(H-2)-sum(area_n))
for i in range(9):
  print(area_n[i])


print(id(area_n[0]),id(area_n[1]))
test=[0]*2
print(id(test[0]),id(test[1]))
test[1]=1
print(id(test[0]),id(test[1]))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

H,W,N=map(int,input().split())
ab=[tuple(map(int,input().split())) for i in range(N)]
ab.sort()

r_b=[0]

r_b_app=r_b.append
for i in range(1,N):
  if ab[i][0]!=ab[i-1][0]:
    r_b_app(i)

if N>0:
  r_b_app(N)
rows=tuple(ab[b][0] for b in r_b if b<N)

cols=tuple(tuple(ab[j][1] for j in range(r_b[i],r_b[i+1])) for i in range(len(r_b)-1))

rN=len(cols)


ched_box0=[[[False]*3 for k in range(3)] for j in range((len(cols[0]) if 0<rN else 0))]
ched_box1=[[[False]*3 for k in range(3)] for j in range((len(cols[1]) if 1<rN else 0))]
ched_box2=[[[False]*3 for k in range(3)] for j in range((len(cols[2]) if 2<rN else 0))]

dic_cn0=dict(zip(cols[0],list(range(len(cols[0]))))) if 0<rN else {}
dic_cn1=dict(zip(cols[1],list(range(len(cols[1]))))) if 1<rN else {}
dic_cn2=dict(zip(cols[2],list(range(len(cols[2]))))) if 2<rN else {}

area_n=[0]*9

count=[[1]*3 for i in range(3)]
find_cn=[0]*12

for rn in range(rN):
  cN=len(cols[rn])
  row=rows[rn]

  if rn!=0:
    ched_box0=ched_box1
    dic_cn0=dic_cn1
    ched_box1=ched_box2
    dic_cn1=dic_cn2
    if rn<rN-2:
      cN2_range=range(len(cols[rn+2]))
      ched_box2=[[[False]*3 for k in range(3)] for j in cN2_range]
      dic_cn2=dict(zip(cols[rn+2],list(cN2_range)))

  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
    ched_box=ched_box0[cn]
    
    box_row_0_cols=[]
    box_row_1_cols=[]
    box_row_2_cols=[]
    
    for box_col in range(3):
      if not ched_box[0][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-2>=1 and row<=H:
          box_row_0_cols.append(box_col)
        else:
          ched_box[0][box_col]=True
      if not ched_box[1][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-1>=1 and row+1<=H:
          box_row_1_cols.append(box_col)
        else:
          ched_box[1][box_col]=True
      if not ched_box[2][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row>=1 and row+2<=H:
          box_row_2_cols.append(box_col)
        else:
          ched_box[2][box_col]=True
 
    
      
    find_rowcol=[]

    find_rowcol_app=find_rowcol.append
    find_cn_n=0

    if (col+1 in dic_cn0 if col+1<=W else False):
      find_rowcol_app((row,col+1))
      find_cn[find_cn_n]=dic_cn0[col+1]
      find_cn_n+=1
    if (col+2 in dic_cn0 if col+2<=W else False):
      find_rowcol_app((row,col+2))
      find_cn[find_cn_n]=dic_cn0[col+2]
      find_cn_n+=1
    if (row1<=H if row1 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn1:
          find_rowcol_app((row1,ch_col))
          find_cn[find_cn_n]=dic_cn1[ch_col]
          find_cn_n+=1
    if (row2<=H if row2 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn2:
          find_rowcol_app((row2,ch_col))
          find_cn[find_cn_n]=dic_cn2[ch_col]
          find_cn_n+=1

        
    for i,(find_row,find_col) in enumerate(find_rowcol):
      
      if find_row is row:
        ch_rn=0
        ch_cn=find_cn[i]
      elif find_row is row1:
        ch_rn=1
        ch_cn=find_cn[i]
      elif find_row is row2:
        ch_rn=2
        ch_cn=find_cn[i]
      box_row_min=find_row-row
      box_col_min=max(find_col-col,0)
      box_col_max=min(3,3+find_col-col)
      


      if len(box_row_2_cols):
        box_row=2
        for box_col in range(max(box_col_min,min(box_row_2_cols)),min(box_col_max,1+max(box_row_2_cols))):
          count[box_row][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][box_row-box_row_min][box_col-find_col+col]=True

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

H,W,N=map(int,input().split())
ab=[tuple(map(int,input().split())) for i in range(N)]
ab.sort()

r_b=[0]

r_b_app=r_b.append
for i in range(1,N):
  if ab[i][0]!=ab[i-1][0]:
    r_b_app(i)

if N>0:
  r_b_app(N)
rows=tuple(ab[b][0] for b in r_b if b<N)

cols=tuple(tuple(ab[j][1] for j in range(r_b[i],r_b[i+1])) for i in range(len(r_b)-1))

rN=len(cols)


ched_box0=[[[False]*3 for k in range(3)] for j in range((len(cols[0]) if 0<rN else 0))]
ched_box1=[[[False]*3 for k in range(3)] for j in range((len(cols[1]) if 1<rN else 0))]
ched_box2=[[[False]*3 for k in range(3)] for j in range((len(cols[2]) if 2<rN else 0))]

dic_cn0=dict(zip(cols[0],list(range(len(cols[0]))))) if 0<rN else {}
dic_cn1=dict(zip(cols[1],list(range(len(cols[1]))))) if 1<rN else {}
dic_cn2=dict(zip(cols[2],list(range(len(cols[2]))))) if 2<rN else {}

area_n=[0]*9

count=[[1]*3 for i in range(3)]
find_cn=[0]*12

for rn in range(rN):
  cN=len(cols[rn])
  row=rows[rn]

  if rn!=0:
    ched_box0=ched_box1
    dic_cn0=dic_cn1
    ched_box1=ched_box2
    dic_cn1=dic_cn2
    if rn<rN-2:
      cN2_range=range(len(cols[rn+2]))
      ched_box2=[[[False]*3 for k in range(3)] for j in cN2_range]
      dic_cn2=dict(zip(cols[rn+2],list(cN2_range)))

  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
    ched_box=ched_box0[cn]
    
    box_row_0_cols=[]
    box_row_1_cols=[]
    box_row_2_cols=[]
    
    for box_col in range(3):
      if not ched_box[0][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-2>=1 and row<=H:
          box_row_0_cols.append(box_col)
        else:
          ched_box[0][box_col]=True
      if not ched_box[1][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-1>=1 and row+1<=H:
          box_row_1_cols.append(box_col)
        else:
          ched_box[1][box_col]=True
      if not ched_box[2][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row>=1 and row+2<=H:
          box_row_2_cols.append(box_col)
        else:
          ched_box[2][box_col]=True
 
    
      
    find_rowcol=[]

    find_rowcol_app=find_rowcol.append
    find_cn_n=0

    if (col+1 in dic_cn0 if col+1<=W else False):
      find_rowcol_app((row,col+1))
      find_cn[find_cn_n]=dic_cn0[col+1]
      find_cn_n+=1
    if (col+2 in dic_cn0 if col+2<=W else False):
      find_rowcol_app((row,col+2))
      find_cn[find_cn_n]=dic_cn0[col+2]
      find_cn_n+=1
    if (row1<=H if row1 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn1:
          find_rowcol_app((row1,ch_col))
          find_cn[find_cn_n]=dic_cn1[ch_col]
          find_cn_n+=1
    if (row2<=H if row2 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn2:
          find_rowcol_app((row2,ch_col))
          find_cn[find_cn_n]=dic_cn2[ch_col]
          find_cn_n+=1

        
    for i,(find_row,find_col) in enumerate(find_rowcol):
      
      if find_row is row:
        ch_rn=0
        ch_cn=find_cn[i]
      elif find_row is row1:
        ch_rn=1
        ch_cn=find_cn[i]
      elif find_row is row2:
        ch_rn=2
        ch_cn=find_cn[i]
      box_row_min=find_row-row
      box_col_min=max(find_col-col,0)
      box_col_max=min(3,3+find_col-col)
      
 

      if len(box_row_2_cols):
        box_row=2
        for box_col in range(max(box_col_min,min(box_row_2_cols)),min(box_col_max,1+max(box_row_2_cols))):
          count[box_row][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][box_row-box_row_min][box_col-find_col+col]=True



            
    for box_col in box_row_0_cols:
      area_n[count[0][box_col]-1]+=1
      count[0][box_col]=1
    for box_col in box_row_1_cols:
      area_n[count[1][box_col]-1]+=1
      count[1][box_col]=1
    for box_col in box_row_2_cols:
      area_n[count[2][box_col]-1]+=1
      count[2][box_col]=1
      
          



print((W-2)*(H-2)-sum(area_n))
for i in range(9):
  print(area_n[i])

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

H,W,N=map(int,input().split())
ab=[tuple(map(int,input().split())) for i in range(N)]
ab.sort()

r_b=[0]

r_b_app=r_b.append
for i in range(1,N):
  if ab[i][0]!=ab[i-1][0]:
    r_b_app(i)

if N>0:
  r_b_app(N)
rows=tuple(ab[b][0] for b in r_b if b<N)

cols=tuple(tuple(ab[j][1] for j in range(r_b[i],r_b[i+1])) for i in range(len(r_b)-1))

rN=len(cols)


ched_box0=[[[False]*3 for k in range(3)] for j in range((len(cols[0]) if 0<rN else 0))]
ched_box1=[[[False]*3 for k in range(3)] for j in range((len(cols[1]) if 1<rN else 0))]
ched_box2=[[[False]*3 for k in range(3)] for j in range((len(cols[2]) if 2<rN else 0))]

dic_cn0=dict(zip(cols[0],list(range(len(cols[0]))))) if 0<rN else {}
dic_cn1=dict(zip(cols[1],list(range(len(cols[1]))))) if 1<rN else {}
dic_cn2=dict(zip(cols[2],list(range(len(cols[2]))))) if 2<rN else {}

area_n=[0]*9

count=[[1]*3 for i in range(3)]
find_cn=[0]*12

for rn in range(rN):
  cN=len(cols[rn])
  row=rows[rn]

  if rn!=0:
    ched_box0=ched_box1
    dic_cn0=dic_cn1
    ched_box1=ched_box2
    dic_cn1=dic_cn2
    if rn<rN-2:
      cN2_range=range(len(cols[rn+2]))
      ched_box2=[[[False]*3 for k in range(3)] for j in cN2_range]
      dic_cn2=dict(zip(cols[rn+2],list(cN2_range)))

  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
    ched_box=ched_box0[cn]
    
    box_row_0_cols=[]
    box_row_1_cols=[]
    box_row_2_cols=[]
    
    for box_col in range(3):
      if not ched_box[0][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-2>=1 and row<=H:
          box_row_0_cols.append(box_col)
        else:
          ched_box[0][box_col]=True
      if not ched_box[1][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row-1>=1 and row+1<=H:
          box_row_1_cols.append(box_col)
        else:
          ched_box[1][box_col]=True
      if not ched_box[2][box_col]:
        if col-2+box_col>=1 and col+box_col<=W and row>=1 and row+2<=H:
          box_row_2_cols.append(box_col)
        else:
          ched_box[2][box_col]=True
 
    
      
    find_rowcol=[]

    find_rowcol_app=find_rowcol.append
    find_cn_n=0

    if (col+1 in dic_cn0 if col+1<=W else False):
      find_rowcol_app((row,col+1))
      find_cn[find_cn_n]=dic_cn0[col+1]
      find_cn_n+=1
    if (col+2 in dic_cn0 if col+2<=W else False):
      find_rowcol_app((row,col+2))
      find_cn[find_cn_n]=dic_cn0[col+2]
      find_cn_n+=1
    if (row1<=H if row1 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn1:
          find_rowcol_app((row1,ch_col))
          find_cn[find_cn_n]=dic_cn1[ch_col]
          find_cn_n+=1
    if (row2<=H if row2 is not None else False):
      for ch_col in range(max(col-2,1),min(col+3,W+1)):
        if ch_col in dic_cn2:
          find_rowcol_app((row2,ch_col))
          find_cn[find_cn_n]=dic_cn2[ch_col]
          find_cn_n+=1

        
    for i,(find_row,find_col) in enumerate(find_rowcol):
      
      if find_row is row:
        ch_rn=0
        ch_cn=find_cn[i]
      elif find_row is row1:
        ch_rn=1
        ch_cn=find_cn[i]
      elif find_row is row2:
        ch_rn=2
        ch_cn=find_cn[i]
      box_row_min=find_row-row
      box_col_min=max(find_col-col,0)
      box_col_max=min(3,3+find_col-col)
      
      if box_row_min==0 and len(box_row_0_cols):
        box_row=0
        for box_col in range(max(box_col_min,min(box_row_0_cols)),min(box_col_max,1+max(box_row_0_cols))):
          count[box_row][box_col]+=1
          if ch_rn is 0:
            ched_box0[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          elif ch_rn is 1:
            ched_box1[ch_cn][box_row-box_row_min][box_col-find_col+col]=True
          else:
            ched_box2[ch_cn][box_row-box_row_min][box_col-find_col+col]=True




            
    for box_col in box_row_0_cols:
      area_n[count[0][box_col]-1]+=1
      count[0][box_col]=1
    for box_col in box_row_1_cols:
      area_n[count[1][box_col]-1]+=1
      count[1][box_col]=1
    for box_col in box_row_2_cols:
      area_n[count[2][box_col]-1]+=1
      count[2][box_col]=1
      
          



print((W-2)*(H-2)-sum(area_n))
for i in range(9):
  print(area_n[i])