Wg9CYx - Online C++0x Compiler & Debugging Tool

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

#define TASK "test"

#define ll long long
#define fi first
#define sc second
#define ii pair <int, int>

#define rep(i,s,e) for (int i = (s), _e = (e); i <= _e; i++)
#define reo(i,s,e) for (int i = (s), _e = (e); i >= _e; i--)

const int maxn = 2000;
const int mod = 1e9 + 7;
const int inf = 1e9;

int n, m, q;
char a[maxn + 5][maxn + 5];
int pre[3][maxn + 5][maxn + 5];

int rect (int t, int u, int v, int x, int y)
{
    return pre[t][x][y] - pre[t][x][v - 1] - pre[t][u - 1][y] + pre[t][u - 1][v - 1];
}

signed main ()
{
    cin.tie(0)->sync_with_stdio(false);
//    #ifndef ONLINE_JUDGE
//    freopen(TASK".inp","r",stdin);
//    freopen(TASK".out","w",stdout);
//    #endif

    cin >> n >> m >> q;
    rep (i, 1, n) rep (j, 1, m)
        cin >> a[i][j];

    rep (i, 1, n) rep (j, 1, m)
    {
        pre[0][i][j] = pre[0][i - 1][j] + pre[0][i][j - 1] - pre[0][i - 1][j - 1] + (a[i][j] == '1');
        pre[1][i][j] = pre[1][i - 1][j] + pre[1][i][j - 1] - pre[1][i - 1][j - 1] + (a[i][j] == '1' and a[i][j + 1] == '1');
        pre[2][i][j] = pre[2][i - 1][j] + pre[2][i][j - 1] - pre[2][i - 1][j - 1] + (a[i][j] == '1' and a[i + 1][j] == '1');
    }

    while (q--)
    {
        int u, v, x, y;
        cin >> u >> v >> x >> y;
        int num = rect(0, u, v, x, y);
        int one = rect(1, u, v, x, y - 1);
        int two = rect(2, u, v, x - 1, y);;
        cout << num - one - two << '\n';
    }

    return 0;
}