20分,1RE,3WA,求助
查看原帖
20分,1RE,3WA,求助
857729
savage_tea楼主2023/4/13 16:54
/*
luogu problem p5729
2nd try
coder:savage_tea
*/

#include<bits/stdc++.h>

using namespace std;

int main()
{
	int w,x,h;
	cin>>w>>x>>h;
	int q;
	cin>>q;
	
	bool arr[w][x][h];
	memset(arr,false,sizeof(arr));
	
	for (int cnt=0;cnt<q;cnt++)
	{
		int x1,x2,y1,y2,z1,z2;
		cin>>x1>>y1>>z1>>x2>>y2>>z2;
		for (int i=min(x1,x2);i<=max(x1,x2);i++)	
		{
			for (int j=min(y1,y2);j<=max(y1,y2);j++)
			{
				for (int k=min(z1,z2);k<=max(z1,z2);k++)
				{
					arr[i][j][k] = true;
				}
			}
		}
	}
	
	int cnter=0;
	
	for (int i=0;i<w;i++)
	{
		for (int j=0;j<x;j++)
		{
			for (int k=0;k<h;k++)
			{
				if (arr[i][j][k] == false) cnter++;
			}
		}
	}
	
	cout<<cnter<<endl;
	
	return 0;
}
2023/4/13 16:54
加载中...