poj 1046 Color Me Less -- 模拟

最新推荐文章于 2019-06-24 16:31:50 发布

几人憔悴几人泪

最新推荐文章于 2019-06-24 16:31:50 发布

阅读量383

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟文章标签： poj 模拟

本文链接：https://blog.csdn.net/qq_27717967/article/details/51307891

模拟专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一种将RGB颜色空间中的颜色映射到较小目标集的算法。输入包含一组目标颜色及待映射的颜色，通过计算欧几里得距离找到最接近的目标颜色。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Color Me Less

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 32942		Accepted: 16006

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)#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct point{
    int r,g,b;
}p[20];
int main(){
	int x,y,z,i,ans,t;
	for(i=0;i<16;i++)
		scanf("%d %d %d",&p[i].r,&p[i].g,&p[i].b);
	while(~scanf("%d %d %d",&x,&y,&z)){
		if(x==-1&&y==-1&&z==-1)
			break;
		int minn = 255*255*255;
		t=0;
		for(i=0;i<16;i++){
			ans = (p[i].r-x)*(p[i].r-x)+(p[i].g-y)*(p[i].g-y)+(p[i].b-z)*(p[i].b-z);
			if(ans < minn){
				t = i;
				minn = ans;
			}
		}
		printf("(%d,%d,%d) maps to (%d,%d,%d)\n",x,y,z,p[t].r,p[t].g,p[t].b);
		
	}
	return 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)
模拟题目