| Task: | Forest density |
| Sender: | aalto26dm_028 |
| Submission time: | 2026-09-21 17:03:34 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.04 s | details |
| #2 | WRONG ANSWER | 0.32 s | details |
| #3 | WRONG ANSWER | 0.27 s | details |
Code
import sys
def main():
data = sys.stdin.buffer.read().split()
it = iter(data)
n = int(next(it))
q = int(next(it))
forest = [
list(map(lambda c: 0 if c == "." else 1, list((str(next(it))).split("'")[1])))
for _ in range(n)
]
premade = []
for i in range(n):
premade.append([])
for j in range(n):
val = forest[i][j]
if i > 0 and j > 0:
val += premade[i][j - 1] + premade[i - 1][j] - premade[i - 1][j - 1]
premade[i].append(val)
for _ in range(q):
a = int(next(it)) - 1
b = int(next(it)) - 1
c = int(next(it)) - 1
d = int(next(it)) - 1
val = premade[c][d]
if a > 0 and b > 0:
val += premade[a - 1][b - 1] - premade[c][b - 1] - premade[a - 1][d]
print(val)
main()
Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 100 **.*.*.**. *.**.*..*. .*****.**. **....***. ... |
| correct output |
|---|
| 10 14 5 7 8 ... |
| user output |
|---|
| 10 14 5 7 25 ... |
Feedback: Incorrect character on line 5 col 1: expected "8", got "25"
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 200000 **.**.****..**.***..**.***.**.... |
| correct output |
|---|
| 41079 2824 15631 1548 8483 ... |
| user output |
|---|
| 41079 2824 15631 1548 8483 ... |
Feedback: Incorrect character on line 237 col 1: expected "34701", got "176083"
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 200000 ******************************... |
| correct output |
|---|
| 1000000 1000000 1000000 1000000 1000000 ... |
| user output |
|---|
| 998002 998002 998002 998002 998002 ... |
Feedback: Incorrect character on line 1 col 1: expected "1000000", got "998002"
