ZOJ Problem Set - 1067

【【简单题】】

【题目】

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)三维数组是用来表示计算机颜色空间的常用方法，每个分量取值0~255表示24位颜色。现给出如下定义：2个颜色(R1,G1,B1)、(R2,G2,B2)之间的差值D为RGB的向量值差，即。

        假设某个场景的计算机系统无法存储所有的颜色空间，仅能存储16个基本颜色，其他的颜色均映射到这16个基本颜色上，映射法则为与之差值最小的基本颜色 。输入的数据先输入16个基本颜色的RGB分量，然后逐一输入需要映射的颜色，输出该颜色映射到哪个基本色上，格式为“(R,G,B) maps to (基本色R,基本色G,基本色B)”，输入以三个-1结束。

【解答】

（一）分析：对于输入的需要映射的颜色(R,G,B)，逐一与基本色(Rn,Gn,Bn)计算差值的平方D^2=(R-Rn)^2+(G-Gn)^2+(B-Bn)^2，选出最小的D^2即可。

（二）代码：

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

/* RGB表示的颜色 */
typedef struct rgb
{
	int x,y,z;
}RGB;

/**********************
主函数
**********************/
int main()
{
	int x,y,z,i,d2,min,rx,ry,rz,mx,my,mz;
	RGB color[16];
	//输入16个基础色
	for(i=0;i<16;i++)
	{
		scanf("%d%d%d",&x,&y,&z);
		color[i].x=x;
		color[i].y=y;
		color[i].z=z;
	}
	//将输入的颜色映射到基础色
	while(scanf("%d%d%d",&x,&y,&z)!=EOF)
	{
		if(x==-1&&y==-1&&z==-1)
			break;
		for(i=0;i<16;i++)
		{
			rx=color[i].x-x;
			ry=color[i].y-y;
			rz=color[i].z-z;
			d2=rx*rx+ry*ry+rz*rz;
			if(i==0)
			{
				min=d2;
				mx=color[i].x;
				my=color[i].y;
				mz=color[i].z;
			}
			else if(d2<min)
			{
				min=d2;
				mx=color[i].x;
				my=color[i].y;
				mz=color[i].z;
			}
		}
		printf("(%d,%d,%d) maps to (%d,%d,%d)\n",x,y,z,mx,my,mz);
	}
        return 0;
}
//Accepted

(解于2009/10)