思路：通过周围的的块判断当前位置能不能放这个块

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+1,M=100,INF=0x7fffffffff;
int n,m,val[N],giver[M],f[N][7],vis[N],cnt[N],a[M][M][M],b[M][M][M],d[M],dx[]={-1,0,0},dy[]={0,-1,0},dz[]={0,0,-1},maxn=-INF,minn=INF;
struct node{
	int x,y,z;
}block[N];
void print()
{
	cout<<"\n";
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			for(int k=1;k<=n;k++)
			{
				cout<<a[i][j][k]<<" ";
			}
			cout<<"\n";
		}
		cout<<"\n";
	}
}
bool check(int u,int x,int y,int z)
{
	if(x>n||y>n||z>n||a[x][y][z])return 0;
	for(int i=0;i<3;i++)
	{
		int xx=x+dx[i],yy=y+dy[i],zz=z+dz[i],v;
		bool flag=0;
		v=a[xx][yy][zz];
		if(!v)continue;
		for(int j=1;j<=cnt[j];j++)
		{
			if(f[v][j]==u)
			{
				flag=1;
				break;
			}
		}
		if(!flag)return 0;
	}
	return 1;
}
void build()
{
	queue<int>q;
	q.push(a[1][1][1]);
	block[a[1][1][1]].x=block[a[1][1][1]].y=block[a[1][1][1]].z=vis[a[1][1][1]]=1;
	while(!q.empty())
	{
		int u=q.front(),x,y,z;
		x=block[u].x;
		y=block[u].y;
		z=block[u].z;
		q.pop();
		for(int i=1;i<=cnt[u];i++)
		{
			int v=f[u][i];
			if(vis[v])continue;
			if(check(v,x+1,y,z))
			{
				a[x+1][y][z]=v;
				block[v].x=x+1,block[v].y=y,block[v].z=z;
				q.push(v);
			}else if(check(v,x,y+1,z))
			{
				a[x][y+1][z]=v;
				block[v].x=x,block[v].y=y+1,block[v].z=z;
				q.push(v);
			}else
			{
				a[x][y][z+1]=v;
				block[v].x=x,block[v].y=y,block[v].z=z+1;
				q.push(v);
			}
			vis[v]=1;
		}
	}
}
void calc()
{
	int sum=0;
	for(int i=1;i<=m;i++)
	{
		int x=block[giver[i]].x,y=block[giver[i]].y,z=block[giver[i]].z;
		if(d[i]==1)
		{
			while(y<n)
			{
				sum+=(b[x][++y][z]^1)*val[a[x][y][z]];
				b[x][y][z]=1;
			}
		}else if(d[i]==2)
		{
			while(y>1)
			{
				sum+=(b[x][--y][z]^1)*val[a[x][y][z]];
				b[x][y][z]=1;
			}
		}else if(d[i]==3)
		{
			while(x<n)
			{
				sum+=(b[++x][y][z]^1)*val[a[x][y][z]];
				b[x][y][z]=1;
			}
		}else if(d[i]==4)
		{
			while(x>1)
			{
				sum+=(b[--x][y][z]^1)*val[a[x][y][z]];
				b[x][y][z]=1;
			}
		}else if(d[i]==5)
		{
			while(z<n)
			{
				sum+=(b[x][y][++z]^1)*val[a[x][y][z]];
				b[x][y][z]=1;
			}
		}else 
		{
			while(z>1)
			{
				sum+=(b[x][y][--z]^1)*val[a[x][y][z]];
				b[x][y][z]=1;
			}
		}
	}
	maxn=max(maxn,sum),minn=min(minn,sum);
	for(int i=1;i<=m;i++)
	{
		int x=block[giver[i]].x,y=block[giver[i]].y,z=block[giver[i]].z;
		if(d[i]==1)
		{
			while(y<n)
			{
				b[x][++y][z]=0;
			}
		}else if(d[i]==2)
		{
			while(y>1)
			{
				b[x][--y][z]=0;
			}
		}else if(d[i]==3)
		{
			while(x<n)
			{
				b[++x][y][z]=0;
			}
		}else if(d[i]==4)
		{
			while(x>1)
			{
				b[--x][y][z]=0;
			}
		}else if(d[i]==5)
		{
			while(z<n)
			{
				b[x][y][++z]=0;
			}
		}else 
		{
			while(z>1)
			{
				b[x][y][--z]=0;
			}
		}
	}
	return;
}
void dfs(int k)
{
	if(k>m)
	{
		calc();
		return;
	}
	for(int i=1;i<=6;i++)
	{
		d[k]=i;
		dfs(k+1);
	}
}
signed main()
{
	cin>>n;
	string s;
	getchar();
	for(int i=1,x;i<=n*n*n;i++)
	{
		getline(cin,s);
		stringstream sin(s);
		sin>>val[i];
		char c;
		while(sin>>x)
		{
			f[i][++cnt[i]]=x;
		}
		if(cnt[i]==3)
		{
			a[1][1][1]=i;
		}
		if(!val[i])giver[++m]=i;
	}
	build();
//	print();
	dfs(1);
	if(minn==INF)cout<<"0 0";
	else cout<<minn<<" "<<maxn;
	return 0;
}