UVA-Box

最新推荐文章于 2022-01-14 17:31:32 发布

BeHelium

最新推荐文章于 2022-01-14 17:31:32 发布

阅读量229

点赞数

分类专栏： Begining Algorithm Contests 文章标签： UVA C/C++

本文链接：https://blog.csdn.net/qq_24133491/article/details/73195465

版权

Begining Algorithm Contests 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Ivan works at a factory that produces heavy machinery. He has a simple job — he knocks up wooden boxes of different sizes to pack machinery for delivery to the customers. Each box is a rectangular parallelepiped. Ivan uses six rectangular wooden pallets to make a box. Each pallet is used for one side of the box.
这里写图片描述
Joe delivers pallets for Ivan. Joe is not very smart and often makes mistakes — he brings Ivan pallets that do not fit together to make a box. But Joe does not trust Ivan. It always takes a lot of time to explain Joe that he has made a mistake.

Fortunately, Joe adores everything related to computers and sincerely believes that computers never make mistakes. Ivan has decided to use this for his own advantage. Ivan asks you to write a program that given sizes of six rectangular pallets tells whether it is possible to make a box out of them.

Input

Input file contains several test cases. Each of them consists of six lines. Each line describes one pallet and contains two integer numbers w and h (1 ≤ w, h ≤ 10 000) — width and height of the pallet in
millimeters respectively.

Output

For each test case, print one output line. Write a single word‘POSSIBLE’ to the output file if it is possible to make a box using six given pallets for its sides. Write a single word ‘IMPOSSIBLE’ if it is not possible to do so.

Sample Input

1345 2584
2584 683
2584 1345
683 1345
683 1345
2584 683
1234 4567
1234 4567
4567 4321
4322 4567
4321 1234
4321 1234

Sample Output

POSSIBLE
IMPOSSIBLE

题意：根据给出的六个面的长和宽，求是否可以拼成一个六面体
方法：六面体相对的两个面的长和宽必然是相等的，并且每两个面之间有一条相邻边，此边的长度也是相等的

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;

typedef struct Side
{
    int width;
    int lenth;
}Side;
Side Box[6];

bool cmp(Side x, Side y){
    return (x.lenth<y.lenth || (x.lenth==y.lenth && x.width<y.width));
}

bool isBox(){
    if(Box[0].lenth == Box[1].lenth && Box[1].lenth == Box[2].lenth &&
       Box[0].width == Box[1].width && Box[1].width == Box[4].lenth &&
       Box[2].width == Box[3].width && Box[3].width == Box[4].width &&
       Box[4].lenth == Box[5].lenth && Box[4].width == Box[5].width)
        return true;
    return false;
}

void CompareBox(){
   sort(Box, Box+5, cmp);
}

int main()
{
    int w,l;
    while(scanf("%d %d", &w, &l) != EOF){
        if(l > w){
            Box[0].lenth = w;
            Box[0].width = l;
        }
        else
        {
            Box[0].lenth = l;
            Box[0].width = w;
        }
        for(int i=1; i<6; i++){
            scanf("%d %d", &w, &l);
            if(l > w){
                Box[i].lenth = w;
                Box[i].width = l;
            }
            else
            {
                Box[i].lenth = l;
                Box[i].width = w;
            }
        }
        CompareBox();
        if(isBox())
            printf("POSSIBLE\n");
        else
            printf("IMPOSSIBLE\n");
    }
    return 0;
}