思路是输入的时候先整理数据,让小边在前,然后6个长方形输入完之后排序,首先要保证两两相等,才能继续判断,然后把0,2,4下标的数据取出来,暴力枚举,一开始是有8种情况,但是由于是排好序的,也就是有前提条件的约束,只剩下最长边等于最短边,以及剩下的两种情况了,分别是三面一样,有两面一样,每一面都不一样,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
bool cmp(pa a, pa b) {
if (a.fi != b.fi) return a.fi < b.fi;
else return a.se < b.se;
}
int main() {
int w, h;
pa p[10];
int num = 0;
while (cin >> w >> h) {
if (w > h) swap(w, h);
p[num++] = make_pair(w, h);
if (num < 6) continue;
sort(p, p + 6, cmp);
if (p[0] != p[1] || p[2] != p[3] || p[4] != p[5]) {
cout << "IMPOSSIBLE\n";
num = 0;
continue;
}
int a1 = p[0].fi, a2 = p[0].se, b1 = p[2].fi, b2 = p[2].se, c1 = p[4].fi, c2 = p[4].se;
if(a1 == b1 && a2 == c1 && c2 == b2 || a1 == c1 && a2 == b1 && c2 == b2 || c2 == a1) cout << "POSSIBLE\n";
else cout << "IMPOSSIBLE\n";
num = 0;
}
return 0;
}