ParallelepipedUnion
SRM 312 · 2006-07-22 · by Petr
Problem Statement
You are given 2 rectangular parallelepipeds (rectangular solids) in space, edges parallel to coordinate axes. Compute the volume of their union.
For example, consider the two following parallelepipeds (they are divided into unit cubes for clarity):
and 
When combined in the following manner, their union is a figure of volume 12 (it consists of 12 unit blocks: ten on the bottom level, and two on the top level):
You are given a String[] parallelepipeds containing exactly two elements. Each element represents a single parallelepiped, and is formatted as "x1 y1 z1 x2 y2 z2" (quotes for clarity only), where (x1, y1, z1) and (x2, y2, z2) are the coordinates of opposing corners of the parallelepiped.
Constraints
- parallelepipeds will contain exactly 2 elements.
- Each element of parallelepipeds will be formatted as "x1 y1 z1 x2 y2 z2" (quotes for clarity only).
- In each element of parallelepipeds, x1 < x2, y1 < y2, z1 < z2.
- All coordinates will be integers between 1 and 100, inclusive, without extra leading zeroes.
{"1 1 1 4 4 2", "3 2 1 5 3 3"}
Returns: 12
The example from the problem statement.
{"1 1 1 2 2 2", "3 3 3 4 4 4"}
Returns: 2
Two unit cubes that do not intersect.
{"1 10 20 5 15 23", "2 12 22 3 14 23"}
Returns: 60
One parallelepiped inside another.
{"28 31 21 67 60 81","60 1 21 67 50 81"}
Returns: 80460
{"34 3 50 37 6 53","36 1 51 38 4 55"}
Returns: 49
Submissions are judged against all 147 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Language: C++17 · define a public class ParallelepipedUnion with a public method int getVolume(vector<string> parallelepipeds) · 147 test cases · 2 s / 256 MB per case