https://www.luogu.org/recordnew/show/17460324

题解：

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp,sum;
int psd[2][3];
char str;
struct node{};
bool vis[2][3][N];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){
    scanf("%d",&n);
    scanf("%d%d%d",&psd[0][0],&psd[0][1],&psd[0][2]);
    scanf("%d%d%d",&psd[1][0],&psd[1][1],&psd[1][2]);
    for(int i=0;i<=1;i++){
        for(int j=0;j<=2;j++){
            for(int k=psd[i][j]-2;k<=psd[i][j]+2;k++){
                if(k<1){
                    vis[i][j][k+n]=1;
                }else if(k>n){
                    vis[i][j][k-n]=1;
                }else{
                    vis[i][j][k]=1;
                }
            }
        }
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            for(int k=1;k<=n;k++)
                if(vis[0][0][i]&&vis[0][1][j]&&vis[0][2][k])ans++;
                else if(vis[1][0][i]&&vis[1][1][j]&&vis[1][2][k])ans++;
    cout<<ans<<endl;
    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}