提出 #48290758

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int mx = 1e3 + 5;

int n, q;
int a[mx][mx];

ll g(int x, int y){
    if(x<=n && y<=n)
        return a[x][y];
    int xx = x / n, xm = x % n;
    int yy = y / n, ym = y % n;

    ll ans = 0;
    ans += 1LL * g(n, n) * xx * yy;
    ans += 1LL * g(xm, n) * yy;
    ans += 1LL * g(n, ym) * xx;
    ans += 1LL * g(xm, ym);

    return ans;
}

ll f(int x, int y, int xx, int yy){
    return g(xx, yy) - g(x, yy) - g(xx, y) + g(x, y);
}

int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n >> q;

    char ch;
    for(int i=1; i<=n; ++i)
    for(int j=1; j<=n; ++j){
        cin >> ch;
        a[i][j] = ch == 'B';
        a[i][j] += a[i-1][j];
        a[i][j] += a[i][j-1];
        a[i][j] -= a[i-1][j-1];
    }

    int x, y, xx, yy;
    while(q--){
        cin >> x >> y >> xx >> yy;
        cout << f(x, y, xx+1, yy+1) << "\n";
    }

    return 0;
}

提出情報

ジャッジ結果