| Task: | Forest density |
| Sender: | banghalq |
| Submission time: | 2025-09-22 16:20:56 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | details |
| #2 | ACCEPTED | 0.42 s | details |
| #3 | ACCEPTED | 0.37 s | details |
Code
n,q = [int(x) for x in input().split()]
forest = []
for _ in range(n):
row = list(input().split())[0]
forest.append([int(c=='*') for c in row])
prefix_sum_array = [[0 for _ in range(n+1)]]
for i in range(1, n+1):
prefix_sum = [0 for _ in range(n+1)]
sum_val = 0
for j in range(1, n+1):
sum_val += forest[i-1][j-1]
prefix_sum[j] = prefix_sum_array[i-1][j] + sum_val
prefix_sum_array.append(prefix_sum)
solution = []
for _ in range(q):
y1, x1, y2, x2 = [int(x) for x in input().split()]
solution.append(prefix_sum_array[y2][x2]
- prefix_sum_array[y2][x1-1]
- prefix_sum_array[y1-1][x2]
+ prefix_sum_array[y1-1][x1-1]
)
for elt in solution:
print(elt)
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 |
