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: Runtime Error

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=[0]*15
    find_cn=[[0]*5 for _ in range(3)]

    find_rowcol[2]=1
    find_cn[0][2]=cn
    if (col+1 in dic_cn0 if col+1<=W else False):
      find_rowcol[3]=1
      find_cn[0][3]=dic_cn0[col+1]
    if (col+2 in dic_cn0 if col+2<=W else False):
      find_rowcol[4]=1
      find_cn[0][4]=dic_cn0[col+2]
    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[5*(row1-row)+ch_col-col+2]=1
          find_cn[row1-row][ch_col-col+2]=dic_cn1[ch_col]
    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[5*(row2-row)+ch_col-col+2]=1
          find_cn[row2-row][ch_col-col+2]=dic_cn2[ch_col]
    for box_row in range(3):
      for box_col in range(3):
        if not ched_box[box_row][box_col]:
          area_n[sum(find_rowcol[5*box_row+box_col:5*(box_row+2)+box_col+3])-1]+=1
    for ch_row in range(0,3):
      for ch_col in range((0 if ch_row!=0 else 3),5):
        if find_rowcol[5*ch_row+ch_col]:
          for box_row in range(3-ch_row):
            for box_col in range((0 if ch_col>=2 else 2-ch_col),(5-ch_col if ch_col>=2 else 3)):
              if ch_row==0:
                ched_box0[find_cn[ch_row][ch_col]][box_row][box_col]=True
              elif ch_row==row1-row:
                ched_box1[find_cn[ch_row][ch_col]][box_row][box_col]=True
              elif ch_row==row2-row:
                ched_box2[find_cn[ch_row][ch_col]][box_row][box_col]=True




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

Submission status: Runtime Error

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] is row+1 if rn<rN-1 else False):
    row1=row+1
    if (rows[rn+2] is row+2 if rn<rN-2 else False):
      row2=row+2
    else:
      row2=None
  elif (rows[rn+1] is 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_col=[]
    box_row_1_col=[]
    box_row_2_col=[]
    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_col.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-2+1>=1 and row+1<=H:
          box_row_1_col.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-2+2>=1 and row+2<=H:
          box_row_2_col.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
            
    #del dic_cn0[col]
        
    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]
      
       for box_row in range(find_row-row,3):
        for box_col in range(max(find_col-col,0),min(3,3+find_col-col)):
          if not ched_box[box_row][box_col]:
            count[box_row][box_col]+=1
            if ch_rn is 0:
              ched_box0[ch_cn][box_row-find_row+row][box_col-find_col+col]=True
            elif ch_rn is 1:
              ched_box1[ch_cn][box_row-find_row+row][box_col-find_col+col]=True
            else:
              ched_box2[ch_cn][box_row-find_row+row][box_col-find_col+col]=True
    for box_row in range(3):
      for box_col in range(3):
        if not ched_box[box_row][box_col]:
          area_n[count[box_row][box_col]-1]+=1
          count[box_row][box_col]=1
    #for box_col in box_row_0_col:
    #  area_n[count[0][box_col]-1]+=1
    #  count[0][box_col]=1
    #for box_col in box_row_1_col:
    #  area_n[count[1][box_col]-1]+=1
    #  count[1][box_col]=1
    #for box_col in box_row_2_col:
    #  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: Runtime Error

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] is row+1 if rn<rN-1 else False):
    row1=row+1
    if (rows[rn+2] is row+2 if rn<rN-2 else False):
      row2=row+2
    else:
      row2=None
  elif (rows[rn+1] is 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_col=[]
    box_row_1_col=[]
    box_row_2_col=[]
    for box_col in range(3):
      if not ched_box[0][box_col] and col-2+box_col>=1 and col+box_col<=W and row-2>=1 and row<=H:
        box_row_0_col.append(box_col)
      if not ched_box[1][box_col] and col-2+box_col>=1 and col+box_col<=W and row-2+1>=1 and row+1<=H:
        box_row_1_col.append(box_col)
      if not ched_box[2][box_col] and col-2+box_col>=1 and col+box_col<=W and row-2+2>=1 and row+2<=H:
        box_row_2_col.append(box_col)



          
          
    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
            
    #del dic_cn0[col]
        
    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]
      
      for box_row in range(find_row-row,3):


        for box_col in range(max(find_col-col,0),min(3,3+find_col-col)):
          if not ched_box[box_row][box_col]:
            count[box_row][box_col]+=1
            if ch_rn is 0:
              ched_box0[ch_cn][box_row-find_row+row][box_col-find_col+col]=True
            elif ch_rn is 1:
              ched_box1[ch_cn][box_row-find_row+row][box_col-find_col+col]=True
            else:
              ched_box2[ch_cn][box_row-find_row+row][box_col-find_col+col]=True

    for box_col in box_row_0_col:
      area_n[count[0][box_col]-1]+=1
      count[0][box_col]=1
    for box_col in box_row_1_col:
      area_n[count[1][box_col]-1]+=1
      count[1][box_col]=1
    for box_col in box_row_2_col:
      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: Runtime Error

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

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

if N>0:
  rows.append(ab[N-1][0])
  r_b.append(N)

cols=[[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:
      ched_box2=[[[False]*3 for k in range(3)] for j in range(len(cols[rn+2]))]
      dic_cn2=dict(zip(cols[rn+2],list(range(len(cols[rn+2])))))

  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]
    if cn<cN-1:
      list_ch_col0=cols[rn][cn+1:min(cN,cn+3)]
       
    for box_row in range(3):
      for box_col in range(3):
        if col-2+box_col<1 or col+box_col>W or row-2+box_row<1 or row+box_row>H:
          ched_box[box_row][box_col]=True
    find_rowcol=[]

    find_rowcol_app=find_rowcol.append
    find_cn_n=0

    for ch_row in range(row,min(row+3,H+1)):
      if ch_row==row:
        for ch_col in range(col+1,min(col+3,W+1)):
          if ch_col in list_ch_col0:
            find_rowcol_app([row,ch_col])
            find_cn[find_cn_n]=list_ch_col0.index(ch_col)+cn+1
            find_cn_n+=1
      elif ch_row==row1:
        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
      elif ch_row==row2:
        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==row:
        ch_rn=0
        ch_cn=find_cn[i]
      elif find_row==row1:
        ch_rn=1
        ch_cn=find_cn[i]
      elif find_row==row2:
        ch_rn=2
        ch_cn=find_cn[i]
      
      for box_row in range(find_row-row,3):
        for box_col in range(max(find_col-col,0),min(3,3+find_col-col)):
          if not ched_box[box_row][box_col]:
            count[box_row][box_col]+=1
            if ch_rn==0:
              ched_box0[ch_cn][box_row-find_row+row][box_col-find_col+col]=True
            elif ch_rn==1:
              ched_box1[ch_cn][box_row-find_row+row][box_col-find_col+col]=True
            else:
              ched_box2[ch_cn][box_row-find_row+row][box_col-find_col+col]=True

    for box_row in range(3):
      for box_col in range(3):
        if not ched_box[box_row][box_col]:
          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])

Submission status: Runtime Error

Solution code:
H,W,N=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(N)]
#ab.sort()

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

if N>0:
  rows.append(ab[N-1][0])
  r_b.append(N)

cols=[[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_box=[[[[False]*3 for k in range(3)] for j in range((len(cols[i]) if i<rN else 0))] for i in range(3)]

area_n=[0]*9

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

  if rn!=0:
    ched_box[0]=ched_box[1]
    ched_box[1]=ched_box[2]
    if rn<rN-2:
      ched_box[2]=[[[False]*3 for k in range(3)] for j in range(len(cols[rn+2]))]
  
  diccol=[dict(zip(cols[rn],list(range(cN))))]
  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    cN1=len(cols[rn+1])
    diccol.append(dict(zip(cols[rn+1],list(range(cN1)))))
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
      cN2=len(cols[rn+2])
      diccol.append(dict(zip(cols[rn+2],list(range(cN2)))))
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    diccol.append(dict(zip(cols[rn+1],list(range(len(cols[rn+1]))))))
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
       
    for boxr in range(3):
      for boxc in range(3):
        if col-2+boxc<1 or col+boxc>W or row-2+boxr<1 or row+boxr>H:
          ched_box[0][cn][boxr][boxc]=True
    find_ab=[set([]) for i in range(3)]
    for chr in range(row,min(row+3,H+1)):
      if chr==row:
        for chc in range(col+1,min(col+3,W+1)):
          if chc in diccol[0]:
            find_ab[0].add(chc)
      elif chr==row1:
        for chc in range(max(col-2,1),min(col+3,W+1)):
          if chc in diccol[1]:
            find_ab[1].add(chc)
      elif chr==row2:
        for chc in range(max(col-2,1),min(col+3,W+1)):
          if chc in diccol[2]:
            find_ab[2].add(chc)



    for boxr in range(3):
      for boxc in range(3):
        if not ched_box[0][cn][boxr][boxc]:
          count=1
          for i in range(3):
            for j in range(3):
              if (col-2+boxc+j in find_ab[-2+boxr+i] if -2+boxr+i>=0 else False):
                count+=1
                if row-2+boxr+i==row1:
                  ched_box[1][diccol[1][col-2+boxc+j]][2-i][2-j]=True
                elif row-2+boxr+i==row2:
                  ched_box[2][diccol[2][col-2+boxc+j]][2-i][2-j]=True
                else:
                  ched_box[0][diccol[0][col-2+boxc+j]][2-i][2-j]=True
          area_n[count-1]+=1

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

Submission status: Runtime Error

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

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

if N>0:
  rows.append(ab[N-1][0])
  r_b.append(N)

cols=[[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_box=[[[[False]*3 for k in range(3)] for j in range((len(cols[i]) if i<rN else 0))] for i in range(3)]

area_n=[0]*9

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

  if rn!=0:
    ched_box[0]=ched_box[1]
    ched_box[1]=ched_box[2]
    if rn<rN-2:
      ched_box[2]=[[[False]*3 for k in range(3)] for j in range(len(cols[rn+2]))]
  
  diccol=[dict(zip(cols[rn],list(range(len(cols[rn])))))]
  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    diccol.append(dict(zip(cols[rn+1],list(range(len(cols[rn+1]))))))
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
      diccol.append(dict(zip(cols[rn+2],list(range(len(cols[rn+2]))))))
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    diccol.append(dict(zip(cols[rn+1],list(range(len(cols[rn+1]))))))
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
       
    for boxr in range(3):
      for boxc in range(3):
        if col-2+boxc<1 or col+boxc>W or row-2+boxr<1 or row+boxr>H:
          ched_box[0][cn][boxr][boxc]=True
    find_ab=[set([]) for i in range(3)]
    for chr in range(row,min(row+3,H+1)):
      if chr==row:
        for chc in range(col+1,min(col+3,W+1)):
          if chc in diccol[0]:
            find_ab[0].add(chc)
      elif chr==row1:
        for chc in range(max(col-2,1),min(col+3,W+1)):
          if chc in diccol[1]:
            find_ab[1].add(chc)
      elif chr==row2:
        for chc in range(max(col-2,1),min(col+3,W+1)):
          if chc in diccol[2]:
            find_ab[2].add(chc)



    for boxr in range(3):
      for boxc in range(3):
        if not ched_box[0][cn][boxr][boxc]:
          count=1
          for i in range(3):
            for j in range(3):
              if (col-2+boxc+j in find_ab[-2+boxr+i] if -2+boxr+i>=0 else False):
                count+=1
                if row-2+boxr+i==row1:
                  ched_box[1][diccol[1][col-2+boxc+j]][2-i][2-j]=True
                elif row-2+boxr+i==row2:
                  ched_box[2][diccol[2][col-2+boxc+j]][2-i][2-j]=True
                else:
                  ched_box[0][diccol[0][col-2+boxc+j]][2-i][2-j]=True
          area_n[count-1]+=1

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

Submission status: Runtime Error

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

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

cols=[[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_box=[[[[False]*3 for k in range(3)] for j in range((len(cols[i]) if i<rN else 0))] for i in range(3)]

area_n=[0]*9

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

  if rn!=0:
    ched_box[0]=ched_box[1]
    ched_box[1]=ched_box[2]
    if rn<rN-2:
      ched_box[2]=[[[False]*3 for k in range(3)] for j in range(len(cols[rn+2]))]
  
  diccol=[dict(zip(cols[rn],list(range(len(cols[rn])))))]
  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    diccol.append(dict(zip(cols[rn+1],list(range(len(cols[rn+1]))))))
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
      diccol.append(dict(zip(cols[rn+2],list(range(len(cols[rn+2]))))))
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    diccol.append(dict(zip(cols[rn+1],list(range(len(cols[rn+1]))))))
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
       
    for boxr in range(3):
      for boxc in range(3):
        if col-2+boxc<1 or col+boxc>W or row-2+boxr<1 or row+boxr>H:
          ched_box[0][cn][boxr][boxc]=True
    find_ab=[set([]) for i in range(3)]
    for chr in range(row,min(row+3,H+1)):
      if chr==row:
        for chc in range(col+1,min(col+3,W+1)):
          if chc in diccol[0]:
            find_ab[0].add(chc)
      elif chr==row1:
        for chc in range(max(col-2,1),min(col+3,W+1)):
          if chc in diccol[1]:
            find_ab[1].add(chc)
      elif chr==row2:
        for chc in range(max(col-2,1),min(col+3,W+1)):
          if chc in diccol[2]:
            find_ab[2].add(chc)



    for boxr in range(3):
      for boxc in range(3):
        if not ched_box[0][cn][boxr][boxc]:
          count=1
          for i in range(3):
            for j in range(3):
              if (col-2+boxc+j in find_ab[-2+boxr+i] if -2+boxr+i>=0 else False):
                count+=1
                if row-2+boxr+i==row1:
                  ched_box[1][diccol[1][col-2+boxc+j]][2-i][2-j]=True
                elif row-2+boxr+i==row2:
                  ched_box[2][diccol[2][col-2+boxc+j]][2-i][2-j]=True
                else:
                  ched_box[0][diccol[0][col-2+boxc+j]][2-i][2-j]=True
          area_n[count-1]+=1

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

Submission status: Runtime Error

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

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

cols=[[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_box=[[[[False]*3 for k in range(3)] for j in range((len(cols[i]) if i<rN else 0))] for i in range(3)]

area_n=[0]*9

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

  if rn!=0:
    ched_box[0]=ched_box[1]
    ched_box[1]=ched_box[2]
    if rn<rN-2:
      ched_box[2]=[[[False]*3 for k in range(3)] for j in range(len(cols[rn+2]))]
  
  setcol=[]
  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    setcol.append(set(cols[rn+1]))
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
      setcol.append(set(cols[rn+2]))
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    setcol.append(set(cols[rn+1]))
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
       
    for boxr in range(3):
      for boxc in range(3):
        if col-2+boxc<1 or col+boxc>W or row-2+boxr<1 or row+boxr>H:
          ched_box[0][cn][boxr][boxc]=True
    find_ab=[]
    for chr in range(row,min(row+3,H+1)):
      if chr==row:
        ch_col=set(cols[rn][cn+1:min(cn+3,cN)])
        for chc in range(min(col+1,W),min(col+3,W+1)):
          if chc in ch_col:
            find_ab.append([row,chc])
      elif: chr in [row+1,row+2]:
          if chr==row1:
            ch_col=setcol[0]
          elif chr==row2:
            ch_col=setcol[1]
          else:
            ch_col=[]
          for chc in range(max(col-2,1),min(col+3,W+1)):
            if chc in ch_col:
              find_ab.append([chr,chc])

    
    for boxr in range(3):
      for boxc in range(3):
        if not ched_box[0][cn][boxr][boxc]:
          count=1
          for i in range(3):
            for j in range(3):
              if [row-2+boxr+i,col-2+boxc+j] in find_ab:
                count+=1
                if row-2+boxr+i==row1:
                  rn_tmp=rn+1
                elif row-2+boxr+i==row2:
                  rn_tmp=rn+2
                else:
                  rn_tmp=rn
                ched_box[rn_tmp-rn][cols[rn_tmp].index(col-2+boxc+j)][2-i][2-j]=True
          area_n[count-1]+=1

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

Submission status: Runtime Error

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

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

cols=[[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_box=[[[[False]*3 for k in range(3)] for j in range((len(cols[i]) if i<rN else 0))] for i in range(3)]

area_n=[0]*9

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

  if rn!=0:
    ched_box[0]=ched_box[1]
    ched_box[1]=ched_box[2]
    if rn<rN-2:
      ched_box[2]=[[[False]*3 for k in range(3)] for j in range(len(cols[rn+2]))]
  
  setcol=[]
  if (rows[rn+1]==row+1 if rn<rN-1 else False):
    row1=row+1
    setcol.append(set(cols[rn+1]))
    if (rows[rn+2]==row+2 if rn<rN-2 else False):
      row2=row+2
      setcol.append(set(cols[rn+2]))
    else:
      row2=None
  elif (rows[rn+1]==row+2 if rn<rN-1 else False):
    row1=row+2
    setcol.append(set(cols[rn+1]))
    row2=None
  else:
    row1=None
    row2=None
  
  for cn in range(cN):
    col=cols[rn][cn]
       
    for boxr in range(3):
      for boxc in range(3):
        if col-2+boxc<1 or col+boxc>W or row-2+boxr<1 or row+boxr>H:
          ched_box[0][cn][boxr][boxc]=True
    find_ab=[]
    for chr in range(rn,min(rn+3,rN)):
      if chr==rn:
        ch_col=set(cols[chr][cn+1:min(cn+3,cN)])
        for chc in range(min(col+1,W),min(col+3,W+1)):
          if chc in ch_col:
            find_ab.append([row,chc])
      else:
        if rows[chr] in [row+1,row+2]:
          if rows[chr]==row1:
            ch_col=setcol[0]
          else:
            ch_col=setcol[1]
          for chc in range(max(col-2,1),min(col+3,W+1)):
            if chc in ch_col:
              find_ab.append([row+chr-rn,chc])

    
    for boxr in range(3):
      for boxc in range(3):
        if not ched_box[0][cn][boxr][boxc]:
          count=1
          for i in range(3):
            for j in range(3):
              if [row-2+boxr+i,col-2+boxc+j] in find_ab:
                count+=1
                if row-2+boxr+i==row1:
                  rn_tmp=rn+1
                elif row-2+boxr+i==row2:
                  rn_tmp=rn+2
                else:
                  rn_tmp=rn
                ched_box[rn_tmp-rn][cols[rn_tmp].index(col-2+boxc+j)][2-i][2-j]=True
          area_n[count-1]+=1

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