Box

UVa1587

这道题要组成长方体，每两面是相等的，但是没有顺序，

所以就去掉一个重复的，就只剩三个，然后枚举这三个，

将所有可能列举出来。

#include <stdio.h>
#include <string.h>
#include <vector>
#define clr( a ) memset ( a, 0, sizeof ( a ) )
const int maxn = 6, N = 10005;
int x[maxn], y[maxn], vis[maxn];
template < class T >
void swap ( T & a, T & b )  //模板交换
{
    T t = a;
    a = b;
    b = t;
}
int solve ( )
{
    int a0 = x[0], b0 = y[0];
    int a1 = x[1], b1 = y[1];
    int a2 = x[2], b2 = y[2];   //暴力枚举,将所有可能情况列举
    if ( a0 == a1 && b1 == a2 && b2 == b0 )
        return 1;
    if ( a0 == a1 && b1 == b2 && a2 == b0 )
        return 1;
    if ( a0 == b1 && a1 == a2 && b2 == b0 )
        return 1;
    if ( a0 == b1 && a1 == b2 && a2 == b0 )
        return 1;
    if ( a0 == a2 && a1 == b2 && b0 == b1 )
        return 1;
    if ( a0 == a2 && b1 == b2 && a1 == b0 )
        return 1;
    if ( a0 == b2 && a1 == a2 && b0 == b1 )
        return 1;
    if ( a0 == b2 && b1 == a2 && a1 == b0 )
        return 1;
    return 0;
}
int main ( )
{
    int n, flag;
    while ( ~ scanf ( "%d", &x[0] ) )
    {
        clr ( vis );
        scanf ( "%d", &y[0] );
        if ( x[0] < y[0] )  //将所有大的放后面
            swap ( x[0], y[0] );
        for ( int i = 1; i < maxn; i ++ )
        {
            scanf ( "%d%d", &x[i], &y[i] );
            if ( x[i] < y[i] )
                swap ( x[i], y[i] );
        }
        n = 0;
        for ( int i = 0; i < maxn; i ++ )
        {
            if ( vis[i] )
                continue ;
            x[n] = x[i];
            y[n ++] = y[i];
            for ( int j = i+1; j < maxn; j ++ )
            //最多去掉一个重复的,并标记
                if ( x[n-1] == x[j] && y[n-1] == y[j] )
                {
                    vis[j] = 1;
                    break ;
                }
        }
        if ( n != 3 )   //不为3就证明不能形成
        {
            printf ( "IMPOSSIBLE\n" );
            continue ;
        }
        printf ( solve ( ) ? "POSSIBLE\n" : "IMPOSSIBLE\n" );
    }
    return 0;
}