light oj 1211 - Intersection of Cubes (计算几何）

      1211 - Intersection of Cubes

PDF (English)

Statistics

Forum

Time Limit: 0.5 second(s)

Memory Limit: 32 MB

You are given n cubes, each cube is described by twopoints in 3D space:(x₁, y₁, z₁) beingone corner of the cube and(x₂, y₂, z₂)being the opposite corner. Assume that the sides of each of the cubes areparallel to the axis. Your task is to find the volume of their intersection.

Input

Input starts with an integer T (≤ 100),denoting the number of test cases.

Each case starts with a line containing an integer n (1≤ n ≤ 100). Each of the nextn lines contains sixintegersx₁ y₁ z₁ x₂ y₂z₂ (1 ≤ x₁, y₁, z₁, x₂,y₂, z₂ ≤ 1000, x₁ < x₂, y₁< y₂, z₁ < z₂) where (x₁,y₁, z₁) is the co-ordinate of one corner and(x₂,y₂, z₂) is the co-ordinate of the opposite corner.

Output

For each case, print the case number and volume of theirintersection.

Sample Input	Output for Sample Input
2 2 1 1 1 3 3 3 1 1 1 2 2 2 3 7 8 9 20 20 30 2 2 2 50 50 50 13 14 15 18 30 40	Case 1: 1 Case 2: 450

 

这题是要求所有立方体重叠部分的体积，首先从两个立方体的情况考虑然后推广到N个，不然情况太乱，从最简单的模型入手容易把问题想清楚

先从一个顶点入手然后分配坐标，下发到每一个立方体

---

Problem Setter: Jane Alam Jan    

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
using namespace std;
const int inf = 0x3f3f3f3f;


int main()
{
    int t, ncase=1;
    scanf("%d", &t);
    while(t--)
    {
        int n;
        scanf("%d", &n);
        int a[]={0,0,0,0,inf,inf,inf};
        while(n--)
        {
            for(int i=1; i<=3; i++)
            {
                int tmp;
                scanf("%d", &tmp);
                if(tmp>a[i])
                {
                    a[i]=tmp;
                }
            }
            for(int i=4; i<=6; i++)
            {
                int tmp;
                scanf("%d", &tmp);
                if(tmp<a[i])
                {
                    a[i]=tmp;
                }
            }
        }
        if(a[1]<=a[4]&&a[2]<=a[5]&&a[3]<=a[6])
        {
            int v=(a[4]-a[1])*(a[5]-a[2])*(a[6]-a[3]);
            printf("Case %d: %d\n",ncase++,v);
        }
        else
        {
            printf("Case %d: 0\n",ncase++);
        }
    }
    return 0;
}