/*
中文题目 程序设计
中文翻译-大意 求最短距离
题目大意:前16组为测试数据,后面为输入数据,找出和前面的测试数据距离最短的数据,并将它输出
解题思路:先把第一组数据作为样本,用后面的数据和前面的数据比较大小,比min还小的话,就将它储存在min里面,并记录此时 i 的位置,方便后面的输出
难点详解:看懂题意,一开始那么多数据没看懂是啥意思,后来才发现前16组数据是测试数据啊!
关键点:看懂题意
解题人:lingnnichong
解题时间:2014/08/19 14:04
解题体会:英语不好,看到一大溜英语就头疼
*/
Color Me Less
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 30357 | Accepted: 14759 |
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
![](https://i-blog.csdnimg.cn/blog_migrate/6a8eebe9d04c25e300a89793f69398d7.gif)
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.
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)
#include<stdio.h>
int x[20],y[20],z[20];
int main()
{
int i,j;
int a,b,c;
int min,num,s;
for(i=0;i<16;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
while(1)
{
scanf("%d%d%d",&a,&b,&c);
if(a==-1&&b==-1&&c==-1) break;
min=(a-x[0])*(a-x[0])+(b-y[0])*(b-y[0])+(c-z[0])*(c-z[0]);
num=0;
for(i=1;i<16;i++)
{
s=(a-x[i])*(a-x[i])+(b-y[i])*(b-y[i])+(c-z[i])*(c-z[i]);
if(s<min)
{
min=s;
num=i;
}
}
printf("(%d,%d,%d) maps to (%d,%d,%d)\n",a,b,c,x[num],y[num],z[num]);
}
return 0;
}