Forest density

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:46:27: warning: '*input[0][0]' may be used uninitialized [-Wmaybe-uninitialized]
   46 |     sum[0][0] = input[0][0];
      |                 ~~~~~~~~~~^

#include <cassert>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

// Create sum array, REMEMBER TO TAKE BY REFERENCE
void create_sub_sum_array(vector<int> &input, int length, vector<int> &aux)
{
    assert(length > 0);
    aux[0] = input[0];
    for (int i = 1; i < length; i++) {
        aux[i] = aux[i - 1] + input[i];
    }
}

// Get subarray sum
int sub_array_sum(vector<int> &sums, int a, int b)
{
    assert(a <= b);
    int reduction = a - 1 < 0 ? 0 : sums[a - 1];
    return sums[b] - reduction;
}

int main(int argc, char *argv[])
{
	// Read the input parameters
	int n, q;
	cin >> n >> q;

	// Read values from one line
    int input[n][n];
    for (int j = 0; j < n; j++) {
        for (int i = 0; i < n; i++) {
            char tmp;
            cin >> tmp;
            if (tmp == '*') input[j][i] = 1;
            else input[j][i] = 0;
            // cin >> input[j][i];
        }
    }

    int sum[n][n];
    sum[0][0] = input[0][0];
    for (int j = 0; j < n; j++) {
        int row_sum = 0;
        for (int i = 0; i < n; i++) {
            row_sum += input[j][i];
            sum[j][i] = row_sum;
            if (j >= 1) {
                sum[j][i] += sum[j-1][i];
            }        }
    }

    // for (int j = 0; j < n; j++) {
    //     for (int i = 0; i < n; i++) {
    //         cout << sum[j][i] << " ";
    //     }
    //     cout << "\n";
    // }


	for (int i = 0; i < q; i++) {
        int y1, x1, y2, x2;
        cin >> x1 >> y1 >> x2 >> y2;
        // fix coordinates
        y1--;
        y2--;
        x1--;
        x2--;
        // cout << y1 << x1 << y2 << x2 << "\n";
        if (x1 >= 1 && y1 >= 1) {
            cout << sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1-1] << "\n";
            continue;
            // cout << sum[x2][y2] << sum[x1 - 1][y2] << sum[x2][y1 - 1] << sum[x1 - 1][y1-1] << "\n";
        }
        if (x1 == 0 && y1 == 0){
            cout << sum[x2][y2];
            continue;
        }
        if (y1 == 0) {
            cout << sum[x2][y2] - sum[x1-1][y2] << "\n";
            continue;
        }
        if (x1 == 0) {
            cout << sum[x2][y2] - sum[x2][y1-1] << "\n";
            continue;
        }
        // cout << sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1] << "\n";
	}

	// cout << "TODO: result" << "\n";
	return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER