ACM/ICPC Programming Exercise -- 1067 Color Me Less

王朝other·作者佚名  2006-01-09
窄屏简体版  字體: |||超大  

URL: http://acm.zju.edu.cn/show_problem.php?pid=1067

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

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

My Solution: (C++, GCC)

Compare each remaining color with first sixteen ones, and determine the pair which has the shortest distance. Then output the latter.

#include <iostream>

// PS: The code is for study purpose only, never submit it as ones own.

// From: [url=http://blog.csdn.net/mskia/]http://blog.csdn.net/mskia/http://blog.csdn.net/mskia/

// email: ichobits@21cn.com

struct rgb {

int r;

int g;

int b;

};

int main(void) {

rgb base[16];

rgb *endp = base + 15;

for (rgb *p = base; p <= endp; ++p) {

std::cin >> p->r >> p->g >> p->b;

}

rgb *mp = base;

rgb color;

while (std::cin >> color.r >> color.g >> color.b

&& !(color.r == -1 && color.g == -1 && color.b == -1)) {

long r = 195075; // (255 * 255) * 3

for (rgb *p = base; p <= endp; ++p) {

long tr = (p->r - color.r) * (p->r - color.r)

+ (p->g - color.g) * (p->g - color.g)

+ (p->b - color.b) * (p->b - color.b);

if (tr < r) {

r = tr;

mp = p;

if (tr == 0) {

break;

}

}

}

std::cout << '(' << color.r << ',' << color.g << ',' << color.b << ')'

<< " maps to "

<< '(' << mp->r << ',' << mp->g << ',' << mp->b << ')'

<< std::endl;

}

return 0;

}

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
 
© 2005- 王朝網路 版權所有  導航