CSES - Aalto Competitive Programming 2024 - wk4 - Mon - Results
Submission details
Task:Forest density
Sender:louaha1
Submission time:2024-09-23 16:45:37 +0300
Language:Python3 (CPython3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2--details
#3ACCEPTED0.94 sdetails

Code

import sys
input = sys.stdin.read

def solve():
    # Read all input at once
    data = input().splitlines()
    
    # Parse first line
    n, q = map(int, data[0].split())
    
    # Initialize grid and prefix sum array
    grid = data[1:n+1]
    prefix = [[0] * (n + 1) for _ in range(n + 1)]
    
    # Build the prefix sum array
    for i in range(1, n + 1):
        for j in range(1, n + 1):
            prefix[i][j] = (1 if grid[i-1][j-1] == '*' else 0) \
                           + prefix[i-1][j] + prefix[i][j-1] - prefix[i-1][j-1]
    
    # Prepare output list for results
    output = []
    
    # Process each query
    for idx in range(n+1, n+1+q):
        y1, x1, y2, x2 = map(int, data[idx].split())
        result = prefix[y2][x2] - prefix[y1-1][x2] - prefix[y2][x1-1] + prefix[y1-1][x1-1]
        output.append(str(result))
    
    # Output all results at once
    sys.stdout.write("\n".join(output) + "\n")

# Example usage:
solve()

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:

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

correct output
41079
2824
15631
1548
8483
...

user output
(empty)

Test 3

Verdict: ACCEPTED

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

correct output
1000000
1000000
1000000
1000000
1000000
...

user output
1000000
1000000
1000000
1000000
1000000
...
Truncated