关闭

AOJ-AHU-OJ-186 Color Me Less

标签: acmc++ojaojc语言
827人阅读 评论(0) 收藏 举报
分类:
Color Me Less
Time Limit: 1000 ms   Case Time Limit: 1000 ms   Memory Limit: 64 MB
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
Original Transformed
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
Original Transformed
(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个点中欧几里得距离最小的点。不需要开根号,直接求距离的平方
代码如下:
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
typedef struct {
    int R, G, B;
}Node;
Node color[16];
int main() {
	for(int i = 0; i < 16; i++)
        scanf("%d%d%d", &color[i].R, &color[i].G, &color[i].B);
    int rr, gg, bb, ans;
    while(scanf("%d%d%d", &rr, &gg, &bb), rr!=-1&&gg!=-1&&bb!=-1) {
        int mini = 1000000;
        for(int i = 0; i < 16; i++) {
            int D = (color[i].R-rr)*(color[i].R-rr) + (color[i].G-gg)*(color[i].G-gg) + (color[i].B-bb)*(color[i].B-bb);
            if(!D)  {ans = i; break;}
            if(D < mini) {
                mini = D;
                ans = i;
            }
        }
        printf("(%d,%d,%d) maps to (%d,%d,%d)\n", rr, gg, bb, color[ans].R, color[ans].G, color[ans].B);
    }
	return 0;
}


0
0
查看评论

Color Me Less(水题)

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 30564   Accepted: 14881 Description A color reduction i...
  • u013486414
  • u013486414
  • 2014-09-28 14:51
  • 603

ZOJ 1067 Color Me Less

Color Me Less Time Limit: 2 Seconds      Memory Limit: 65536 KB Problem A color reduction is a mapping fro...
  • wpfengqi
  • wpfengqi
  • 2012-08-23 14:12
  • 233

poj 1046 Color Me Less -- 模拟

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 32942   Accepted: 16006 ...
  • qq_27717967
  • qq_27717967
  • 2016-05-03 21:29
  • 149

Color me less

Color Me Less Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 26432 Accepted: 12740 DescriptionA color reduction is a mapping from a s...
  • kidneyoung
  • kidneyoung
  • 2016-09-07 14:05
  • 44

Color Me Less(POJ1046

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 jus...
  • zhang_di233
  • zhang_di233
  • 2015-07-28 15:43
  • 93

POJ1046——Color Me Less

Color Me Less Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 33605   Accepted: 16341 ...
  • LDUtyk
  • LDUtyk
  • 2016-11-15 15:46
  • 211

ZOJ--1067:Color Me Less

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

AOJ186 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...
  • zhaoshu01234
  • zhaoshu01234
  • 2014-02-26 14:05
  • 443

1046 Color Me Less

水题//4377084_AC_0MS_392K #include #include using namespace std;#define MAXINT 2147483647 struct Color{    ...
  • twilightgod
  • twilightgod
  • 2008-12-12 09:14
  • 395

ZJU1067- Color Me Less

测试数据: 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 ...
  • Landscape1112
  • Landscape1112
  • 2016-01-21 20:23
  • 163
    个人资料
    • 访问:404764次
    • 积分:8368
    • 等级:
    • 排名:第2853名
    • 原创:438篇
    • 转载:35篇
    • 译文:0篇
    • 评论:36条
    博客专栏
    最新评论