Box UVA - 1587

题目链接：Box UVA - 1587
题目：给定6个矩形的长和宽$w_{i}和h_{i}(1 <= w_{i}，h_{i} <= 1000)$，判断他们能否构成长方体的6个面。

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<iomanip>
#define ll long long

using namespace std;

struct re{
    int w,h;
} r[6];

bool cmp(struct re a, struct re b) {
    if(a.w != b.w) return a.w < b.w;
    else return a.h > b.h ;
}


bool solve() {
     if(r[0].w!=r[1].w||r[2].w!=r[3].w||r[4].w!=r[5].w||r[0].h!=r[1].h||r[2].h!=r[3].h||r[4].h!=r[5].h){
        return false;
    }
    if(r[0].w!=r[2].w||r[0].h!=r[4].h||r[2].h!=r[4].w){
        return false;
    }
    return true;
}

int main()
{
    while(cin>>r[0].w>>r[0].h>>r[1].w>>r[1].h>>r[2].w>>r[2].h>>r[3].w>>r[3].h>>r[4].w>>r[4].h>>r[5].w>>r[5].h) {
        for(int i = 0; i < 6; i++)
            if(r[i].w > r[i].h) swap(r[i].w,r[i].h);
        sort(r,r+6,cmp);
        if(solve()) puts("POSSIBLE");
        else puts("IMPOSSIBLE");
    }
    return 0;
}