Box(UVA1587 map+pair+set+指针 STL奇巧淫技)

Box（UVA1587）

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≤10000) — 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.

Samples
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
Output
POSSIBLE
IMPOSSIBLE

知识点：

pair与map奥特曼合体==法力无边
set存点边==tql

//#include
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#define size size()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pr;
const int maxn=2e5+7;
const int base=131;
map<int,int>vis;
map<pr,int>bucket;
set<pr>s;
int main()
{
    int w,h;
    int tot=0;
    while(cin>>w>>h)
    {
        int flag=0;
        tot++;
        if(h<w) swap(h,w);//保持顺序一致，利于统计次数
        bucket[{h,w}]++;//该长方形出现的次数
        vis[w]++;
        vis[h]++;
        s.insert({h,w});//存长方形
        if(tot==6)//六次处理一次
        {
            for(set<pr>::iterator it=s.begin(); it!=s.end();it++)
            {
                if(bucket[*it]%2||vis[it->first]%4||vis[it->second]%4)
                {
                    cout<<"IMPOSSIBLE"<<endl;
                    flag=1;
                    break;
                }
            }
            if(!flag)
                cout<<"POSSIBLE"<<endl;
            tot=0;//清空
            vis.clear();
            s.clear();
            bucket.clear();
        }

    }
    return 0;
}