ZOJ Problem Set - 1067 Color Me Less

Color Me Less

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

Problem

A color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform just such a mapping in a standard twenty-four bit RGB color space. The input consists of a target set of sixteen RGB color values, and a collection of arbitrary RGB colors to be mapped to their closest color in the target set. For our purposes, an RGB color is defined as an ordered triple (R,G,B) where each value of the triple is an integer from 0 to 255. The distance between two colors is defined as the Euclidean distance between two three-dimensional points. That is, given two colors (R1,G1,B1) and (R2,G2,B2), their distance D is given by the equation

The input file is a list of RGB colors, one color per line, specified as three integers from 0 to 255 delimited by a single space. The first sixteen colors form the target set of colors to which the remaining colors will be mapped. The input is terminated by a line containing three -1 values.

Output

For each color to be mapped, output the color and its nearest color from the target set.

Example

Input

0 0 0
255 255 255
0 0 1
1 1 1
128 0 0
0 128 0
128 128 0
0 0 128
126 168 9
35 86 34
133 41 193
128 0 128
0 128 128
128 128 128
255 0 0
0 1 0
0 0 0
255 255 255
253 254 255
77 79 134
81 218 0
-1 -1 -1

Output

(0,0,0) maps to (0,0,0)
(255,255,255) maps to (255,255,255)
(253,254,255) maps to (255,255,255)
(77,79,134) maps to (128,128,128)
(81,218,0) maps to (126,168,9)

---

Source:  Greater New York 2001

分析：

首先输入十六行，每行三个数，分别代表r，g，b（三原色）。接着输入若干行（以三个-1结束），每行三个数，分别代表待查询的r，g，b。对于每一次查询，要求输出满足公式，使得D最小的r，g，b。

水题。只有十六个查询的数组，直接暴力。用结构体存储三原色比较方便。

ac代码：

#include<iostream>
#include<cstdio>
using namespace std;


struct Color
{
    int r,g,b;
}color[20];
int main()
{
    int n,i,j;
    int tr,tg,tb;
    for(i=1;i<=16;i++)
    scanf("%d%d%d",&color[i].r,&color[i].g,&color[i].b);
    while(scanf("%d%d%d",&tr,&tg,&tb)&&tr!=-1)
    {
        int minx=65535*4;
        int index=0;
        for(i=1;i<=16;i++)
        {
            int m=(color[i].r-tr)*(color[i].r-tr)+(color[i].g-tg)*(color[i].g-tg)+(color[i].b-tb)*(color[i].b-tb);
            if(m<minx)
            {
                minx=m;
                index=i;
            }
        }
        printf("(%d,%d,%d) maps to (%d,%d,%d)\n",tr,tg,tb,color[index].r,color[index].g,color[index].b);
    }
    return 0;
}