6999.Filled Subgrid Count II

Time Limit: 1s Memory Limit: 512MB

You are given a grid of letters. Your task is to calculate, for each letter, the number of rectangular subgrids whose each letter is the same.

Input Format(From the terminal/stdin)

The first line has two integers $n$ and $k$ : the size of the grid and the number of letters. The letters are the first $k$ uppercase letters.

After this, there are $n$ lines that describe the grid. Each line has $n$ letters.

  • $1 \le n \le 3000$
  • $1 \le k \le 26$

Output Format(To the terminal/stdout)

Print $k$ lines: for each letter, the number of subgrids.

Sample Input

Copy
5 3
ABBBC
BBBBC
BCAAA
AAAAA
AAAAA
 · \n
     \n
     \n
     \n
     \n
     \n

Sample Output

Copy
64
24
4
  \n
  \n
 \n
Source: CSES, Counting Problems, 3414

Submit

请先 登录

© 2025 FAQs