Submission #56544548

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<double,double> pdd;
typedef complex<double> cpx;
#define fastio cin.tie(0)->sync_with_stdio(0); cout.tie(0);
#define all(x) x.begin(),x.end()
#define compress(x) x.erase(unique(all(x)),x.end())
#define ff first
#define ss second
#define INF 1e17
#define SIZE 100010

ll n,q,a[110][110][110];

int main(){
    fastio;
    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];
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                a[i][j][k] += a[i-1][j][k];
            }
        }
    }
    for(int j=1;j<=n;j++){
        for(int i=1;i<=n;i++){
            for(int k=1;k<=n;k++){
                a[i][j][k] += a[i][j-1][k];
            }
        }
    }
    for(int k=1;k<=n;k++){
        for(int j=1;j<=n;j++){
            for(int i=1;i<=n;i++){
                a[i][j][k] += a[i][j][k-1];
            }
        }
    }
    cin >> q;
    while(q--){
        ll l1,r1,l2,r2,l3,r3;
        cin >> l1 >> r1 >> l2 >> r2 >> l3 >> r3;
        l1--; l2--; l3--;
        ll ans = a[r1][r2][r3];
        ans -= a[l1][r2][r3]+a[r1][l2][r3]+a[r1][r2][l3];
        ans += a[l1][l2][r3]+a[l1][r2][l3]+a[r1][l2][l3];
        ans -= a[l1][l2][l3];
        cout << ans << "\n";
    }
}

Submission Info

Judge Result