Forest density

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

template <class T>
void print_v(vector<T> &v) { cout << "{"; for (auto x : v) cout << x << ","; cout << "\b}"; }


int main()
{
    int n;
    int q;
    cin >> n >> q;

    int sum[n][n];

    for (int y = 0; y < n; y++) {
        int line_sum = 0;
        for (int x = 0; x < n; x++) {
            char i;
            cin >> i;

            if (i == '*')
            {
                line_sum++;
            }
           sum[y][x] = line_sum;
        } 
    }

    int queries[q];
    for (int i = 0; i < q; i++) {
        int y1, x1, y2, x2;
        cin >> y1 >> x1>>y2>>x2;
        y1--;y2--;x1--;x2--;
        queries[i] = 0; 
        
        int tc = 0;
        for (int y = y1; y <= y2; y++)
        {
            if (x1 == 0)
            {
                tc += sum[y][x2];
            }
            else
            {
                tc += sum[y][x2] - sum[y][x1 - 1];
            }
        } 
        queries[i] = tc;
    }   
    for (int i = 0; i < q; i++)
        cout << queries[i] << "\n";
   
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED