ZOJ 1067 Color Me Less

原创 2012年08月23日 14:12:15
Color Me Less

Time Limit: 2 Seconds      Memory Limit: 65536 KB

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

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数,再让16个RGB数之后,3个-1之前的几个RGB数分别跟16个RGB数求距离,找到16个RGB

数中距离最小的RGB数。


代码:

#include <stdio.h>
#include <math.h>
#define N 16


int compare(float c[])
{
    int i;
    int k=0;
    int min=c[0];
    for(i=0;i<N;i++)
    {
        if(min>c[i])
        {
            min=c[i];
            k=i;
        }
    }
    return k;
}


int main()
{
    float a[N][3];
    float b[100][3];
    float c[N];
    int n=0,m=0;
    int i,j,k;
    
    for(i=0;i<N;i++)
        for(j=0;j<3;j++)
            scanf("%f",&a[i][j]);
    for(i=0;i<100;i++)
    {
        for(j=0;j<3;j++)
            scanf("%f",&b[i][j]);
        if((b[i][0]==-1)&&(b[i][1]==-1)&&(b[i][2]==-1))
        break;
    }
    n=i;
    for(i=0;i<n;i++)
    {
        for(j=0;j<N;j++)
        {
            for(k=0;k<3;k++)
                c[j]+=pow(a[j][k]-b[i][k], 2);
            c[j]=sqrt(c[j]);
        }
        m=compare(c);
        printf("(%d,%d,%d) maps to (%d,%d,%d)\n",(int)b[i][0],(int)b[i][1],(int)b[i][2],(int)a[m][0],(int)a[m][1],(int)a[m][2]);
   }


    
       return 0;
            
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

zoj 1067 Color Me Less

Color Me Less Time Limit: 2 Seconds      Memory Limit: 65536 KB Problem A color reduction i...

zoj 1067 Color Me Less

正确代码: #include #include #include using namespace std; int main() { int tar[16][3]; for(int i=0;...

ZOJ 1067Color Me Less

Time Limit: 1 Second      Memory Limit: 32768 KB ProblemA color reduction is a mapping from a set of...

ZOJ--1067:Color Me Less

思路: 这题是让 先输入十六组数 然后给后面的每组数 从这十六组数中找通过那个式子值最小的 一组数据 ; 比较简单 不解释 java: import java.util.Scanner; p...
  • yf224
  • yf224
  • 2017-06-14 22:11
  • 77

POJ1046——Color Me Less

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 33605   ...

POJ 1046 Color Me Less

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31449   Accepted: 1...

集训9.5----Color Me Less

题目描述 A color reduction is a mapping from a set of discrete colors to a smaller one.The soluti...

poj 1046(Color Me Less)

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 23677   ...

AOJ-AHU-OJ-186 Color Me Less

Color Me Less Time Limit: 1000 ms   Case Time Limit: 1000 ms   Memory Limit: 64 MB Descr...

Color Me Less POJ - 1046

A color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)