POJ1046简单枚举

来源：互联网发布：钢结构图纸设计软件编辑：程序博客网时间：2024/06/07 02:01

Color Me Less

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34202 Accepted: 16634

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 0255 255 2550 0 11 1 1128 0 00 128 0128 128 00 0 128126 168 935 86 34133 41 193128 0 1280 128 128128 128 128255 0 00 1 00 0 0255 255 255253 254 25577 79 13481 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

Greater New York 2001

题意：先给出16个点，再给出一定数量的点，找出每个点与那16个点最近的那个点，相同的距离按第一次出现输出。

思路：简单的枚举，题目中给出的那个距离公式用了还麻烦一些，就用平方和即可。那就直接开循环一个一个算。以下是我的代码

#include <stdio.h>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",&c[i].R,&c[i].G,&c[i].B);    while(scanf("%d%d%d",&R,&G,&B))    {        int min=255*255*3,j=0;        if(R==-1&&G==-1&&B==-1) break;        for(int i=0; i<16; i++)        {            int t=(c[i].R-R)*(c[i].R-R)+(c[i].G-G)*(c[i].G-G)+(c[i].B-B)*(c[i].B-B);            if(t<min)            {                min=t;                j=i;            }        }        printf("(%d,%d,%d) maps to (%d,%d,%d)\n",R,G,B,c[j].R,c[j].G,c[j].B);    }}

0 0