关闭

zoj 1067 Color Me Less

标签: zoj
251人阅读 评论(0) 收藏 举报
分类:
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个元素,所以直接枚举所有情况比较大小可得结果。

算D时不用开方。

代码:

#include <cstdio>

const int MAX_N = 16;

typedef struct {
    int r;
    int g;
    int b;
} color;

color colSet[MAX_N];
int dis[MAX_N];

void getDis(color c) {
    for (int i = 0; i < MAX_N; i++)
        dis[i] = (c.r - colSet[i].r) * (c.r - colSet[i].r) + (c.g - colSet[i].g) * (c.g - colSet[i].g) + (c.b - colSet[i].b) * (c.b - colSet[i].b);
}

void solve() {
    color c;
    while (~scanf("%d%d%d", &c.r, &c.g, &c.b) && c.r != -1) {
        getDis(c);
        int mini = 0;
        for (int i = 1; i < MAX_N; i++)
            if (dis[i] < dis[mini])
                mini = i;
        printf("(%d,%d,%d) maps to (%d,%d,%d)\n", c.r, c.g, c.b, colSet[mini].r, colSet[mini].g, colSet[mini].b);
    }
}

int main() {
    for (int i = 0; i < MAX_N; i++)
        scanf("%d%d%d", &colSet[i].r, &colSet[i].g, &colSet[i].b);
    solve();
    return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:7498次
    • 积分:491
    • 等级:
    • 排名:千里之外
    • 原创:44篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条
    文章分类