Light Oj 1211 计算多个立方体重叠部分体积
来源:互联网 发布:认知心理学教材 知乎 编辑:程序博客网 时间:2024/04/27 17:06
Intersection of Cubes
Time Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit
Status
Practice
LightOJ 1211
Description
You are given n cubes, each cube is described by two points in 3D space: (x1, y1, z1) being one corner of the cube and (x2, y2, z2) being the opposite corner. Assume that the sides of each of the cubes are parallel 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 next n lines contains six integers x1 y1 z1 x2 y2 z2 (1 ≤ x1, y1, z1, x2, y2, z2 ≤ 1000, x1 < x2, y1 < y2, z1 < z2) where (x1, y1, z1) is the co-ordinate of one corner and (x2, y2, z2) is the co-ordinate of the opposite corner.
Output
For each case, print the case number and volume of their intersection.
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
Sample Output
Case 1: 1
Case 2: 450
<span style="color:#000099;">/********************************************* author : Grant Yuan time : 2014.8.7 algorithm: 计算几何 source : Light Oj 1211 explain : 求几个正方体重叠部分的体积 ***********************************************/#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#define INF 0x3fffffffusing namespace std;int t,n,a[7];int ans;int main(){ scanf("%d",&t);int c; for(int i=1;i<=t;i++) { scanf("%d",&n); a[1]=a[2]=a[3]=0; a[4]=a[5]=a[6]=INF; for(int j=1;j<=n;j++) { for(int k=1;k<=3;k++) { scanf("%d",&c); if(c>a[k]) a[k]=c; } for(int k=4;k<=6;k++) { scanf("%d",&c); if(c<a[k]) a[k]=c; } } if(a[4]>a[1]&&a[5]>a[2]&&a[6]>a[3]) { ans=(a[4]-a[1])*(a[5]-a[2])*(a[6]-a[3]); printf("Case %d: %d\n",i,ans);} else printf("Case %d: 0\n",i); } return 0;}</span>
- Light Oj 1211 计算多个立方体重叠部分体积
- light oj 1211 - Intersection of Cubes (立方体的交集的体积)
- 计算立方体体积的inline函数
- 计算个体积什么的
- 用构造函数计算不同立方体的体积
- 【Algorithm】 重叠部分面积计算
- light oj 1211 - Intersection of Cubes (计算几何)
- 求立方体的体积
- 立方体的体积
- 立方体多个材质
- js 判断多个时间段是否存在重叠的部分
- Light oj 1331 - Agent J【计算】
- Light OJ 1239 计算凸包周长
- JAVA之设计一个立方体类Cube,只有边长属性,计算表面积和体积
- 杭电oj 2002 计算球的体积
- 杭电oj 2002 计算球的体积
- light oj
- light oj
- 启动tomcat报错:org.apache.catalina.loader.DevLoader
- ubuntu下jdk的安装与配置
- JQuery AJAX参数详解补充
- 如何创建Content Provider
- vim中对文本的选择
- Light Oj 1211 计算多个立方体重叠部分体积
- 基本数据结构-栈的实现及其运用
- 超图 Iobject java 7C---学习中
- JSON在服务器端的生成,和所用jar包
- sync 和 fsync
- 【python】判断字符串
- nginx报 502错误
- iOS shareSDK的分享与第三方登陆 (详解)
- 导出数据到excel工具类