Codeforces Round #265 (Div. 2)D. Restore Cube 暴力

D. Restore Cube

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Peter had a cube with non-zero length of a side. He put the cube into three-dimensional space in such a way that its vertices lay at integer points (it is possible that the cube's sides are not parallel to the coordinate axes). Then he took a piece of paper and wrote down eight lines, each containing three integers — coordinates of cube's vertex (a single line contains coordinates of a single vertex, each vertex is written exactly once), put the paper on the table and left. While Peter was away, his little brother Nick decided to play with the numbers on the paper. In one operation Nick could swap some numbers inside a single line (Nick didn't swap numbers from distinct lines). Nick could have performed any number of such operations.

When Peter returned and found out about Nick's mischief, he started recollecting the original coordinates. Help Peter restore the original position of the points or else state that this is impossible and the numbers were initially recorded incorrectly.

Input

Each of the eight lines contains three space-separated integers — the numbers written on the piece of paper after Nick's mischief. All numbers do not exceed 106 in their absolute value.

Output

If there is a way to restore the cube, then print in the first line "YES". In each of the next eight lines print three integers — the restored coordinates of the points. The numbers in the i-th output line must be a permutation of the numbers in i-th input line. The numbers should represent the vertices of a cube with non-zero length of a side. If there are multiple possible ways, print any of them.

If there is no valid way, print "NO" (without the quotes) in the first line. Do not print anything else.

Sample test(s)

input

0 0 0
0 0 1
0 0 1
0 0 1
0 1 1
0 1 1
0 1 1
1 1 1

output

YES
0 0 0
0 0 1
0 1 0
1 0 0
0 1 1
1 0 1
1 1 0
1 1 1

input

0 0 0
0 0 0
0 0 0
0 0 0
1 1 1
1 1 1
1 1 1
1 1 1

output

NO

题意给出8个点的坐标,问能不能通过重排每个点的坐标构成一个正方体,思路暴力枚举每个点的坐标排列,枚举到最后一个点的时候检查是否合法,代码如下

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[9][5],b[8];
LL dis(int i,int j)
{
    LL x=a[i][0]-a[j][0],y=a[i][1]-a[j][1],z=a[i][2]-a[j][2];
    return x*x+y*y+z*z;
}
bool check()
{
    for(int i=0;i<8;i++){
        for(int j=0;j<8;j++)
        {
            if(i==j)continue;
            if(j<i)b[j]=dis(i,j);
            else b[j-1]=dis(i,j);
        }
        sort(b,b+7);
        LL t1=b[0],t2=2*b[0],t3=3*b[0];
        ///检查以i为起始点的三边,三面对角线,体对角线是否满足正方形约束
        if(t1==0||t1!=b[1]||t1!=b[2]||t2!=b[3]||t2!=b[4]||t2!=b[5]||t3!=b[6])return false;
    }
    return true;
}

bool is_ok(int cur)
{
    if(cur==8)
    {
        return check();
    }
    sort(a[cur],a[cur]+3);
    do{
        if(is_ok(cur+1))return true;
    }while(next_permutation(a[cur],a[cur]+3));
    return false;
}
int main()
{
    for(int i=0;i<8;i++)
    cin>>a[i][0]>>a[i][1]>>a[i][2];

    if(!is_ok(0))puts("NO");
    else
    {
        puts("YES");
        for(int i=0;i<8;i++)
        for(int j=0;j<3;j++)
        {
            cout<<a[i][j]<<' ';
            if(j==2)cout<<endl;
        }
    }
    return 0;
}