Color Me Less
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 31693 | Accepted: 15424 |
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
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.
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.
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)
就是相当与三维的坐标，总共16个，然后输入点，求距离最近的点#include <cctype>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <iostream>
#define INF 0x3f3f3f3f
using namespace std;
struct Point
{
int R;
int G;
int B;
} Point[17];
int main()
{
int r,g,b;
for(int i=0; i<16; i++)
{
scanf("%d %d %d",&Point[i].R,&Point[i].G,&Point[i].B);
}
while(~scanf("%d %d %d",&r,&g,&b))
{
if(r==-1&&b==-1&&g==-1)
{
break;
}
double ans=INF;
int point=0;
for(int i=0;i<16;i++)
{
if(ans>sqrt((Point[i].B-b)*(Point[i].B-b)+(Point[i].G-g)*(Point[i].G-g)+(Point[i].R-r)*(Point[i].R-r)))
{
ans=sqrt((Point[i].B-b)*(Point[i].B-b)+(Point[i].G-g)*(Point[i].G-g)+(Point[i].R-r)*(Point[i].R-r));
point=i;
}
}
printf("(%d,%d,%d) maps to (%d,%d,%d)\n",r,g,b,Point[point].R,Point[point].G,Point[point].B);
}
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。