zoukankan      html  css  js  c++  java
  • 5.2.6 Box Relations

    Box Relations

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 270 Accepted Submission(s): 108

    Problem Description
    There are n boxes C1, C2, ..., Cn in 3D space. The edges of the boxes are parallel to the x, y or z-axis. We provide some relations of the boxes, and your task is to construct a set of boxes satisfying all these relations.

    There are four kinds of relations (1 <= i,j <= n, i is different from j):
      • I i j: The intersection volume of Ci and Cj is positive.

      • X i j: The intersection volume is zero, and any point inside Ci has smaller x-coordinate than any point inside Cj.

      • Y i j: The intersection volume is zero, and any point inside Ci has smaller y-coordinate than any point inside Cj.

    • Z i j: The intersection volume is zero, and any point inside Ci has smaller z-coordinate than any point inside Cj.
    .
     

    Input
    There will be at most 30 test cases. Each case begins with a line containing two integers n (1 <= n <= 1,000) and R (0 <= R <= 100,000), the number of boxes and the number of relations. Each of the following R lines describes a relation, written in the format above. The last test case is followed by n=R=0, which should not be processed.
     

    Output

                For each test case, print the case number and either the word POSSIBLE or IMPOSSIBLE. If it\\\\\\\'s possible to construct the set of boxes, the i-th line of the following n lines contains six integers x1, y1, z1, x2, y2, z2, that means the i-th box is the set of points (x,y,z) satisfying x1 <= x <= x2, y1 <= y <= y2, z1 <= z <= z2. The absolute values of x1, y1, z1, x2, y2, z2 should not exceed 1,000,000.

    Print a blank line after the output of each test case.
     

    Sample Input
    3 2
    I 1 2
    X 2 3
    3 3
    Z 1 2
    Z 2 3
    Z 3 1
    1 0
    0 0
     

    Sample Output
    Case 1: POSSIBLE
    0 0 0 2 2 2
    1 1 1 3 3 3
    8 8 8 9 9 9
    
    Case 2: IMPOSSIBLE
    
    Case 3: POSSIBLE
    0 0 0 1 1 1

    我做不起,实在做不起,详见

    http://www.cnblogs.com/yangcl/archive/2012/04/30/2476911.html

  • 相关阅读:
    GoldenGate 19.1实时文本文件加载攻略
    windows 10 excel 打开超连接提示 组织策略阻止...
    验证ogg同步数据库表无主键表且目标表包含隐藏字段
    配置ogg从Oracle到PostgreSQL的同步复制json数据
    pi
    GoldenGate 19.1 发布
    ogg同步DDL时,源和目标端表空间名称不同的解决思路
    总目录索引(开发精华总结)
    Spring Cloud Nacos分布式配置中心
    Spring Cloud Nacos&Feign负载均衡
  • 原文地址:https://www.cnblogs.com/cssystem/p/2920290.html
Copyright © 2011-2022 走看看