Submission details
Task:Forest density
Sender:tjaa
Submission time:2025-09-22 17:00:25 +0300
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.56 sdetails
#3ACCEPTED0.55 sdetails

Code

#include <bits/stdc++.h>
using namespace std;

int main () { 
    int n, q; cin >> n >> q;
    int sq[1001*1001]={0};
    int cumsum[1001*1001] = {0};

    for(int y=1; y<=n; y++) {
        for(int x=1; x<=n; x++) {
            char c; cin >> c;
            sq[y*(n+1) + x] = c == '*' ? 1 : 0;
        }
    }

    for(int y=1; y<=n; y++) {
        for(int x=1; x<=n; x++) {
            cumsum[y*(n+1)+x] = sq[y*(n+1)+x] + cumsum[y*(n+1)+x-1];
        }
        for(int x=1; x<=n; x++) {
            cumsum[y*(n+1)+x] += cumsum[(y-1)*(n+1)+x];
        }
    }

    // for(int y=1; y<=n; y++) {
    //     for(int x=1; x<=n; x++) {
    //         cout << cumsum[y*(n+1)+x];
    //     }
    //     cout << '\n';
    // }

    for(int i=0; i < q; i++) {
        int y1, x1, y2, x2;
        cin >> y1 >> x1 >> y2 >> x2;
        y1--; x1--;
        // cout << "got: " << cumsum[y2*(n+1)+x2] << ' ' << cumsum[y2*(n+1)+x1] << ' ' << cumsum[y1*(n+1)+x2] << ' ' << cumsum[y1*(n+1)+x1] << '\n';
        cout << cumsum[y2*(n+1)+x2] - cumsum[y2*(n+1)+x1] - cumsum[y1*(n+1)+x2] + cumsum[y1*(n+1)+x1] << '\n';
    }

    return 0;
}

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