Submission details
Task:Forest density
Sender:azeaus1
Submission time:2025-09-22 16:21:36 +0300
Language:Python3 (PyPy3)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.55 sdetails
#3ACCEPTED0.47 sdetails

Code

n, q = [int(x) for x in input().split()]
queries = []
forest = []
for _ in range(n):
    forest.append(list(input()))
 
sum_forest = [[0]*n for _ in range(n)]
for i in range(n):
    for j in range(n):
        sum_forest[i][j] = (1 if forest[i][j] == '*' else 0)
        if i > 0:
            sum_forest[i][j] += sum_forest[i-1][j]
        if j > 0:
            sum_forest[i][j] += sum_forest[i][j-1]
        if i > 0 and j > 0:
            sum_forest[i][j] -= sum_forest[i-1][j-1]
 
for _ in range(q):
    y1, x1, y2, x2 = [int(x)-1 for x in input().split()]
    result = sum_forest[y2][x2]
    if y1 > 0:
        result -= sum_forest[y1-1][x2]
    if x1 > 0:
        result -= sum_forest[y2][x1-1]
    if y1 > 0 and x1 > 0:
        result += sum_forest[y1-1][x1-1]
    queries.append(result)
 
for query in queries:
    print(query)

Test details

Test 1

Verdict: ACCEPTED

input
10 100
**.*.*.**.
*.**.*..*.
.*****.**.
**....***.
...

correct output
10
14
5
7
8
...

user output
10
14
5
7
8
...
Truncated

Test 2

Verdict: ACCEPTED

input
1000 200000
**.**.****..**.***..**.***.**....

correct output
41079
2824
15631
1548
8483
...

user output
41079
2824
15631
1548
8483
...
Truncated

Test 3

Verdict: ACCEPTED

input
1000 200000
******************************...

correct output
1000000
1000000
1000000
1000000
1000000
...

user output
1000000
1000000
1000000
1000000
1000000
...
Truncated