Submission #56539790

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
#define int long long
int x[110][110][110];
void solve(){
    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>>x[i][j][k];
            }
        }
    }
    auto f=x;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                f[i][j][k]+=f[i-1][j][k];
            }
        }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
#define int long long
int x[110][110][110];
void solve(){
    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>>x[i][j][k];
            }
        }
    }
    auto f=x;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                f[i][j][k]+=f[i-1][j][k];
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                f[i][j][k]+=f[i][j-1][k];
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                f[i][j][k]+=f[i][j][k-1];
            }
        }
    }
    int q;cin>>q;
    while(q--){
        int xl,xr,yl,yr,zl,zr;
        cin>>xl>>xr>>yl>>yr>>zl>>zr;
        int ans = f[xr][yr][zr]
                - f[xl-1][yr][zr]
                - f[xr][yl-1][zr]
                - f[xr][yr][zl-1]
                + f[xl-1][yl-1][zr]
                + f[xl-1][yr][zl-1]
                + f[xr][yl-1][zl-1]
                - f[xl-1][yl-1][zl-1];
        cout<<ans<<'\n';
    }
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    // int t;cin>>t;while(t--)
    solve();
}

Submission Info

Judge Result