hdu 3231 Box Relations (拓扑排序)

Box Relations

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 894    Accepted Submission(s): 324
Special Judge

Problem Description

There are n boxes C₁, C₂, ..., C_n 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 C_i and C_j is positive.

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

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

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

.

 

 

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

 

 

Source

2009 Asia Wuhan Regional Contest Hosted by Wuhan University

 

 

Recommend

chenrui   |   We have carefully selected several similar problems for you:  3236 3234 3237 3232 3233 

 

//140MS    1276K    1924 B    G++
/*

    题意：
        给出n个矩阵的一系列的关系，输出满足关系的n个矩阵的对角坐标。
    
    拓扑排序：
        矩阵就有六个面，x、y、z各有两个面，设上表面为i+n，下表面为i，
    然后每次的XYZ操作就是对x、y、z轴的上下表面进行拓扑排序，其中要
    注意的一点就是I A B操作，要求A的上表面大于B的下表面，B的上表面
    要大于A的下表面。 调试了挺久的。 

*/
#include<iostream>
#include<vector>
#include<queue>
#define N 2005
using namespace std;
int in[3][N];
vector<int>V[3][N];
int n,r,cas;
void init()  //初始化 
{
    memset(in,0,sizeof(in));
    for(int ii=0;ii<3;ii++)
        for(int i=0;i<=2*n;i++){
            V[ii][i].clear();
        }    
    for(int ii=0;ii<3;ii++)
        for(int i=1;i<=n;i++){
            V[ii][i].push_back(i+n);
            in[ii][i+n]++;
        }
}
int topo(int x[],int id) //topo排序 
{
    queue<int>Q;
    int ii=0;
    for(int i=1;i<=2*n;i++)
        if(in[id][i]==0)
            Q.push(i);
    //printf("*%d\n",Q.size());
    while(!Q.empty()){
        int t=Q.front();
        Q.pop();
        x[t]=++ii; //出来的先排 
        for(int i=0;i<V[id][t].size();i++){
            if(--in[id][V[id][t][i]]==0)
                Q.push(V[id][t][i]);
        }
    }
    //printf("**%d\n",ii);
    if(ii!=2*n) return 1;
    return 0;
} 
void solve()
{
    int a[3][N]={0}; //记录答案 
    int flag=0;
    for(int i=0;i<3;i++)
        if(topo(a[i],i)) flag=1;
    if(flag) printf("Case %d: IMPOSSIBLE\n\n",cas++);
    else{
        printf("Case %d: POSSIBLE\n",cas++);
        for(int i=1;i<=n;i++)
            printf("%d %d %d %d %d %d\n",a[0][i],a[1][i],a[2][i],a[0][i+n],a[1][i+n],a[2][i+n]);
        printf("\n");
    }
}
int main(void)
{
    int a,b;
    char op;
    cas=1;
    while(scanf("%d%d%*c",&n,&r),n+r)
    {
        init();
        for(int i=0;i<r;i++){
            scanf("%c%d%d%*c",&op,&a,&b);
            if(op=='I'){
                for(int ii=0;ii<3;ii++){
                    V[ii][a].push_back(b+n);
                    in[ii][b+n]++;
                    V[ii][b].push_back(a+n);
                    in[ii][a+n]++;
                }
            }else{
                V[op-'X'][a+n].push_back(b);
                in[op-'X'][b]++;
            }
        }
        solve();
    }
    return 0;
}