Color Me Less(POJ1046

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.

题意: 先输入16组RGB,然后之后每输入一组,就找出该组与前16组距离最近即两者的D最小的一组并输出,直到R==-1&&G==-1&&B==-1输入结束.

心得:1.比较距离大小不一定要开根,直接比较平方的大小即可.(对于小数的开根会有误差

        2.对于sqrt()函数,原型为 float sqrt (float),double sqrt (double),double long sqrt(double long)

注意没有sqrt (int),但是返回值可以为int

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 <cstdio>
#include <math.h>
#include <algorithm>
using namespace std;
struct node
{
    int a,b,c;
} st[20];
int main()
{
    for(int i=0; i<16; i++)
        scanf("%d %d %d",&st[i].a,&st[i].b,&st[i].c);
    int x,y,z,p,q,r,sum,cnt,k;
    while(~scanf("%d %d %d",&x,&y,&z))
    {
        if(x==-1&&y==-1&&z==-1)
            break;
        p=abs(x-st[0].a);
        q=abs(y-st[0].b);
        r=abs(z-st[0].c);
        sum=p*p+q*q+r*r;
        k=0;
        for(int i=1; i<16; i++)
        {
            p=abs(x-st[i].a);
            q=abs(y-st[i].b);
            r=abs(z-st[i].c);
            cnt=p*p+q*q+r*r;
            if(sum>cnt)
            {
                sum=cnt;
                k=i;
            }
        }
        printf("(%d,%d,%d) maps to (%d,%d,%d)\n",x,y,z,st[k].a,st[k].b,st[k].c);
    }

    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值