1046 Color Me Less

原创 2012年08月30日 11:04:43

Description

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 

Input

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

If there are more than one color with the same smallest distance, please output the color given first in the color set.

Sample 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

Sample 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)


CODE:

#include <iostream>

typedef struct
{
	int r;
	int g;
	int b;
} Color;

int main(int argc, char* argv[])  
{  
	int min,i,j,temp;
	int r,g,b;
	Color map[16];
	for(i=0;i<16;++i)
		std::cin>>map[i].r>>map[i].g>>map[i].b;
	while(std::cin>>r>>g>>b&&r!=-1&&g!=-1&&b!=-1)
	{
		min=-1;
		j=-1;
		for(i=0;i<16;++i)
		{
			temp=(map[i].r-r)*(map[i].r-r)+
				(map[i].g-g)*(map[i].g-g)+
				(map[i].b-b)*(map[i].b-b);
			if(min<0||min>temp)
			{
				min=temp;
				j=i;
			}
		}
		std::cout<<"("<<r<<","<<g<<","<<b<<") maps to ("
			<<map[j].r<<","<<map[j].g<<","<<map[j].b<<")"<<std::endl;
	}
	
	return 0;
}  


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj 1046(Color Me Less)

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 23677   ...

Color Me Less POJ - 1046

A color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this ...

POJ 1046-Color Me Less【暴力】

A color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this ...

POJ1046——Color Me Less

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 33605   ...

POJ 1046 Color Me Less

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31449   Accepted: 1...

POJ1046 Color Me Less(水题就当玩吧)

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31681   ...

<poj 1046>Color Me Less

Color Me Less   Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 25873 ...

1046 poj Color Me Less

题意:匹配距离最小的两组数,先给你16个数据,然后再输入数据直到输入三个-1结束输入            把后输入的数据与前16个数据进行匹配,如果他们之间的距离在所有数据匹配中最小  ...

集训9.5----Color Me Less

题目描述 A color reduction is a mapping from a set of discrete colors to a smaller one.The soluti...

AOJ-AHU-OJ-186 Color Me Less

Color Me Less Time Limit: 1000 ms   Case Time Limit: 1000 ms   Memory Limit: 64 MB Descr...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)