Forest density

input/code.cpp: In function 'void Test()':
input/code.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         scanf("%d%d%d%d", &a1, &b1, &a2, &b2);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include<iostream>
#include<cstdio>
#include<algorithm>
typedef long long LL;

const int N=1005;

int map[N][N], sum[N][N];

void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    int n, q;
    scanf("%d%d", &n, &q);
    for(int i=1; i<=n; i++)
    {
        char c = getchar(); 
        for(int j=1; j<=n; j++)
        {
            c = getchar();
            map[i][j] = (c == '*');
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            sum[i][j]=sum[i][j-1]+sum[i-1][j]-sum[i-1][j-1]+map[i][j];
// printf("%d ", sum[i][j]);
        }
// putchar('\n');
    }
    while(q--)
    {
        int a1, b1, a2, b2;
        scanf("%d%d%d%d", &a1, &b1, &a2, &b2);
        printf("%d\n", sum[a2][b2]-sum[a2][b1-1]-sum[a1-1][b2]+sum[a1-1][b1-1]);
    }

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED