UVa 1587 Box

9 篇文章 0 订阅

Box

Time Limit: 3000MS
Memory Limit: Unknown 64bit
IO Format: %lld & %llu

Description

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个不同边对。
设为a <= b <= c,则排序后为:
(a, b) (a, c) (b, c)
继续判断得结果。

代码:

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

const int MAX_N = 6;

typedef struct {
    int w;
    int h;
} R;

R rec[MAX_N];

bool cmp(R a, R b) {
    return (a.w < b.w) || ((a.w == b.w) && (a.h < b.h));
}

void swap(int &a, int &b) {
    int t = b;
    b = a;
    a = t;
}

void disp() {
    for (int i = 0; i < MAX_N; i++)
        printf("w:%d, h:%d\n", rec[i].w, rec[i].h);
}

void solve() {
/*

    memset(flag, 0, sizeof(flag));
    for (int i = 0; i < MAX_N; i++) {
        flag[rec[i].w]++;
        flag[rec[i].h]++;
    }
    int count = 0;
    for (int i = 1; i < MAX_M; i++)
        if (flag[i] && flag[i] % 4 == 0)
            count = count + flag[i] / 4;
    if (count == 3)
        puts("POSSIBLE");
    else
        puts("IMPOSSIBLE");
*/
    for (int i = 0; i < 6; i++)
        if (rec[i].w > rec[i].h) {
            swap(rec[i].w, rec[i].h);
        }
    std::sort(rec, rec + 6, cmp);
    // disp();
    for (int i = 0; i < 5; i += 2) {
        if (!(rec[i].w == rec[i + 1].w && rec[i].h == rec[i + 1].h)) {
            puts("IMPOSSIBLE");
            return ;
        }
    }
    if (rec[0].w != rec[2].w || rec[0].h != rec[4].w || rec[2].h != rec[4].h) {
        puts("IMPOSSIBLE");
        return ;
    }
    puts("POSSIBLE");
}

int main() {
    while (~scanf("%d%d", &rec[0].w, &rec[0].h)) {
        for (int i = 1; i < MAX_N; i++)
            scanf("%d%d", &rec[i].w, &rec[i].h);
        solve();
    }
    return 0;
}

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值