POJ 1046 Color Me Less - 追着光梦游

POJ 1046 Color Me Less

ACM解题报告 2017-08-16

Color Me Less

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)
(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)
题目大意:
首先输入16组RGB颜色,作为Target
再给定一组RGB颜色组合,作为Map
然后,对于Map中的每个RGB,求Target中离它最近的RGB
算法:枚举

    #include<iostream>
    using namespace std;
    struct color
    {
        int r,g,b;
    }c[16];
    int main ()
    {
        int r,g,b;
        for(int i=0;i<16;i++)
        {
            scanf("%d %d %d",&r,&g,&b);
            c[i].r=r,c[i].g=g,c[i].b=b;
        }
        while(scanf("%d %d %d",&r,&g,&b))
        {
            if(r==-1&&g==-1&&b==-1)
            break;
            double min=3*255*255;
            int k=0;
            for(int i=0;i<16;i++)
            {
                double temp=(r-c[i].r)*(r-c[i].r)+(g-c[i].g)*(g-c[i].g)+(b-c[i].b)*(b-c[i].b);
                if(temp<min)//<而不是<=,如果出现两个相等,那么还是输出第一个的 
                min=temp,k=i;
            }
            printf("(%d,%d,%d) maps to (%d,%d,%d)\n",r,g,b,c[k].r,c[k].g,c[k].b);
        
        }   
    
        return 0;
     } 

本文由 guopengli 创作,采用 知识共享署名 3.0,可自由转载、引用,但需署名作者且注明文章出处。
  • 浏览次数: 467
  • 还不快抢沙发

    添加新评论