POJ1046——Color Me Less

最新推荐文章于 2020-02-28 17:59:27 发布

sdljtyk

最新推荐文章于 2020-02-28 17:59:27 发布

阅读量610

点赞数

分类专栏： POJ 暴力枚举文章标签： POJ1046 Color Me Less 三原色暴力枚举 A color reduction is

本文链接：https://blog.csdn.net/ldutyk/article/details/53172038

版权

暴力枚举同时被 2 个专栏收录

20 篇文章 0 订阅

订阅专栏

POJ

18 篇文章 0 订阅

订阅专栏

Color Me Less

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 33605		Accepted: 16341

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)

Source

Greater New York 2001

题意：

每一个颜色由R、G、B三部分组成，D表示两个不同颜色的之间的距离，现给出16组目标颜色，剩下的为待匹配的颜色，求出剩下的颜色与目标颜色中哪个最匹配，即D最小。

解：

暴力枚举，输出结果。

#include<stdio.h>
#include<math.h>

int main() 
{
	int r,g,b;
	int r1,g1,b1;
	int a[17][3];
	for(int i=0;i<16;i++){
		scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
	}
	while(~scanf("%d%d%d",&r,&g,&b) && r!=-1 && g!=-1 && b!=-1)
	{
		int point =  0; 
		int min=999999;
		double sum=0;
		for(int i=0;i<16;i++){
			sum=(r-a[i][0])*(r-a[i][0])+(g-a[i][1])*(g-a[i][1])+(b-a[i][2])*(b-a[i][2]);
			if(sum<min)
			{
				min=sum;
				point = i;
			}
		}
		
		printf("(%d,%d,%d) maps to (%d,%d,%d)\n",r,g,b,a[point][0],a[point][1],a[point][2]); 
	}
	return 0;
}