UVA - 1587 Box_ivan works at a factory that produces heavy machin-优快云博客

本文链接：https://blog.youkuaiyun.com/qq_35776409/article/details/112466375

博客围绕判断能否用六个矩形木板构成长方体展开。给出每个木板的长和宽作为输入，需编写程序判断能否构成长方体，输出‘POSSIBLE’或‘IMPOSSIBLE’，还给出了示例输入输出及判断的关键特征。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题目大意：
给出长方体的六个面的长和宽，判断能否构成一个长方体；
对于能够构成长方体的数据排序一下可以发现，比如： 3 2,3 2 ，3 1 ，3 1，2 1,2 1 前四组数据长度相等，后四组数据宽相等，并且最后两组的长等于前两组的宽

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>

using namespace std;

struct Box {
    int wide,lenghth;
}box[7];

inline bool cmp(Box A, Box B) {
    if(A.lenghth != B.lenghth) return A.lenghth > B.lenghth;
    else return A.wide > B.wide;
}

int main() {
    while(cin >> box[0].wide >> box[0].lenghth) {
        if(box[0].wide > box[0].lenghth) swap(box[0].wide , box[0].lenghth);
        for(int i=1; i<6; i++) {
            cin >> box[i].wide >> box[i].lenghth;
            if(box[i].wide > box[i].lenghth) swap(box[i].wide , box[i].lenghth);
        }
        sort(box ,box + 7,cmp);

//        for(int i=0; i<6; i++)
//            cout << box[i].lenghth << " " << box[i].wide << endl;

        bool flag = true;
        for(int i=1; i<4; i++)
            if(box[i].lenghth != box[i - 1].lenghth) flag = false;
        for(int i=3; i<6; i++)
            if(box[i].wide != box[i - 1].wide) flag = false;
        for(int i=4; i<6; i++)
            if(box[i].lenghth != box[i - 4].wide) flag = false;
        if(flag) cout << "POSSIBLE" << endl;
        else cout << "IMPOSSIBLE" << endl;
    }
    return 0;
}