Uva1587

Box UVA - 1587

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.
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

#include<bits/stdc++.h>
#define maxn 100010
using namespace std;
int main()
{
    int w[6],h[6];
    while(cin>>w[0]>>h[0]>>w[1]>>h[1]>>w[2]>>h[2]>>w[3]>>h[3]>>w[4]>>h[4]>>w[5]>>h[5])
    {
        set<int>a;
        for(int i=0;i<6;i++)
        {
            a.insert(w[i]);
            a.insert(h[i]);
        }
        int len=a.size();
        if(len==1)printf("POSSIBLE
");
        else if(len==2)
        {
            int sum=0;
            for(int i=0;i<=5;i++)
            {
                if(w[i]==h[i])
                {
                    sum++;
                }
            }
            if(sum==2)printf("POSSIBLE
");
            else printf("IMPOSSIBLE
");
        }
        else if(len==3)
        {
            int flag=0;
            int k[3],j=0;
            for(set<int>::iterator it=a.begin();it!=a.end();it++)
            {
                k[j++]=*it;
            }
            int k1=0,j1=0,l1=0;
            for(int i=0;i<=5;i++)
            {
                if(w[i]==h[i])
                {
                    flag=1;break;
                }
                if(k[0]==w[i]||k[0]==h[i])k1++;
                if(k[1]==w[i]||k[1]==h[i])j1++;
                if(k[2]==w[i]||k[2]==h[i])l1++;
            }
            if(k1!=4||j1!=4||l1!=4)flag=1;
            if(!flag)printf("POSSIBLE
");
            else printf("IMPOSSIBLE
");
        }
        else
            printf("IMPOSSIBLE
");
    }
    return 0;
}

思路：

判断输入进的每组数中有几个不同的值。

1个值 必定成立。

2个值 如果出现两次w[i]==h[i]成立否则不成立。

3个值 必须保证每个值出现4次且h[i]!=w[i]，第一次做WA就在这里，没有考率到 4 5 ，4 5， 3 4，3 4，3 4，3 5这样的错误情况，只考虑了h[i]!=w[i]。

4个值及以上必定不成立。