Submission details
Task:Forest density
Sender:aalto26dm_002
Submission time:2026-09-21 17:50:06 +0300
Language:Python3 (PyPy3)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.60 sdetails
#3ACCEPTED0.54 sdetails

Code

# cook your dish here
n, q = map(int, input().split())
k = [ [0]* (n + 1)]

h = [[0] * (n + 1) for i in range(n + 1)]

for i in range(1, n+1):
    row = input().strip()
    for j in range(1, n+1):
        if row[j-1] == '*':
            c = 1
        else:
            c = 0
        h[i][j] = h[i-1][j] + h[i][j-1] - h[i-1][j-1] + c
        

for i in range(q):
    y1,x1, y2,x2 = map(int, input().split())
    
    s = h[y2][x2] - h[y1-1][x2] - h[y2][x1-1] + h[y1-1][x1-1]
    print(s)
    
    




Test details

Test 1

Verdict: ACCEPTED

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

correct output
10
14
5
7
8
...

user output
10
14
5
7
8
...

Test 2

Verdict: ACCEPTED

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

correct output
41079
2824
15631
1548
8483
...

user output
41079
2824
15631
1548
8483
...

Test 3

Verdict: ACCEPTED

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

correct output
1000000
1000000
1000000
1000000
1000000
...

user output
1000000
1000000
1000000
1000000
1000000
...