| Task: | Forest density |
| Sender: | francden |
| Submission time: | 2025-09-22 16:54:53 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | details |
| #2 | ACCEPTED | 0.71 s | details |
| #3 | ACCEPTED | 0.65 s | details |
Code
n,q = [int(x) for x in input().split()]
tab = [[0 for i in range(n+1)]]
for i in range (1,n+1):
L = input()
tab.append([0])
for ind,x in enumerate(L):
index = ind+1
if x == '.':
tab[i].append(tab[i][index-1]+tab[i-1][index]-tab[i-1][index-1])
else :
tab[i].append(tab[i][index-1]+tab[i-1][index]-tab[i-1][index-1]+1)
for _ in range (q):
y1,x1,y2,x2 = [int(x) for x in input().split()]
#print(tab[y2][x2],tab[y2][x1-1],tab[y1-1][x2],tab[y1-1][x1-1])
print(tab[y2][x2]-tab[y2][x1-1]-tab[y1-1][x2]+tab[y1-1][x1-1])
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 |
