Color Me Less

最新推荐文章于 2023-02-21 14:17:57 发布

AnselLyy

最新推荐文章于 2023-02-21 14:17:57 发布

阅读量369

点赞数 1

分类专栏： ACM 文章标签： ACM

本文链接：https://blog.csdn.net/AnselLyy/article/details/52443596

版权

ACM 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

本文介绍了一个颜色映射问题，该问题需要将一组RGB颜色值映射到另一个较小的颜色集上。通过计算每种颜色间的欧几里得距离来确定最佳匹配。文章提供了完整的C++实现代码，展示了如何读取颜色值并找到最接近的目标颜色。

摘要由CSDN通过智能技术生成

Color Me Less

题目描述

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

Sample Intput

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)

#include <iostream>
#include <cstdio>

using namespace std;

struct Node{
	int x, y, z;
}node[16];

int main() {
	for (int i = 0; i < 16; i++) {
		scanf("%d%d%d", &node[i].x, &node[i].y, &node[i].z);
	}
	int a, b, c;
	while (scanf("%d%d%d", &a, &b, &c) && a != -1) {
		int map = 0;
		int dist = (a-node[0].x)*(a-node[0].x) + (b-node[0].y)*(b-node[0].y) + (c-node[0].z) * (c-node[0].z);
		for (int i = 1; i < 16; i++) {
			if (dist > (a-node[i].x)*(a-node[i].x) + (b-node[i].y)*(b-node[i].y) + (c-node[i].z) * (c-node[i].z)) {
				dist = (a-node[i].x)*(a-node[i].x) + (b-node[i].y)*(b-node[i].y) + (c-node[i].z) * (c-node[i].z);
				map = i;
			}
		}
		printf("(%d,%d,%d) maps to (%d,%d,%d)\n", a, b, c, node[map].x, node[map].y, node[map].z);
	}
	return 0;
}