Submission #56531278

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(0)->sync_with_stdio(0)
#define fi first
#define se second
#define nm (nl + nr >> 1)
#define xm (xl + xr >> 1)
#define pb(x) push_back(x)
#define all(v) (v).begin(), (v).end()
#define zip(v) (v).erase(unique(all(v)), (v).end())
#define dem_plc(x) cout << fixed << setprecision(x)
#define ox(t) cout << ((t) ? "Yes" : "No") << '\n'
#define continue(x) { cout << (x) << '\n'; continue; }
#define _exit(x) return cout << x, 0
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<pii, int> ppi;
typedef pair<int, pii> pip;
typedef pair<pll, ll> ppl;
typedef pair<ll, pll> plp;
const ll mod = 1e9 + 7; // 998244353
const ll INF = 2e9;
const ll LINF = 4e18;
const db PI = acos(-1);
const int N = 101;

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

// templete end

int a[N][N][N];

int main()
{
    fastio;
    int n; cin >> n;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int k = 1; k <= n; k++) {
        cin >> a[i][j][k];
        a[i][j][k] += a[i][j - 1][k] + a[i][j][k - 1] - a[i][j - 1][k - 1];
    }
    int q; cin >> q;
    while (q--) {
        int li, ri, lj, rj, lk, rk; cin >> li >> ri >> lj >> rj >> lk >> rk;
        int sum = 0;
        for (int i = li; i <= ri; i++) {
            sum += a[i][rj][rk] - a[i][rj][lk - 1] - a[i][lj - 1][rk] + a[i][lj - 1][lk - 1];
        }
        cout << sum << '\n';
    }
}

Submission Info

Judge Result