zoukankan      html  css  js  c++  java
  • poj 1046 Color Me Less

    Color Me Less
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 33007   Accepted: 16050

    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)

    Source

     

    先读懂题意

    很简单,就是给定一个三维点以及一个由16个三维点组成的点集,求这个给定三维点与点集中哪个三维坐标点的距离最小。

    基本思路:

    枚举,就OK了。

    #include<cstdio>
    #include<iostream>
    #include<cmath>
    using namespace std;
    int R[17],G[17],B[17],r,g,b;
    double cl(int r,int g,int b,int i){
        return sqrt((double)(r-R[i])*(r-R[i])+(double)(g-G[i])*(g-G[i])+(double)(b-B[i])*(b-B[i]));
    }
    int main(){
        for(int i=1;i<=16;i++){
            cin>>R[i]>>G[i]>>B[i];
        }
        while(scanf("%d%d%d",&r,&g,&b)==3&&r!=-1&&g!=-1&&b!=-1){
            int ans,flag=0,minn=0x3f3f3f;
            for(int i=1;i<=16;i++){
                ans=cl(r,g,b,i);    
                if(ans<minn){
                    minn=ans;
                    flag=i;
                }
            }
            printf("(%d,%d,%d) maps to (%d,%d,%d)
    ",r,g,b,R[flag],G[flag],B[flag]);
        }    
        return 0;
    }
  • 相关阅读:
    图说jdk1.8新特性(3)--- 注解与类型推测优化
    图说jdk1.8新特性(2)--- Lambda
    图说jdk1.8新特性(1)--- 函数式接口
    Linux应用与端口
    Linu如何查看磁盘占用情况及处理办法
    ThreadLocal剧集(一)
    缓存穿透、缓存击穿、缓存雪崩区别和解决方案
    MySQL 新建用户,为用户授权,指定用户访问数据库
    2019面试总结
    Java的设计模式
  • 原文地址:https://www.cnblogs.com/shenben/p/5535896.html
Copyright © 2011-2022 走看看