Solution of ZOJ 1067 Color Me Less

Problem 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.

 

---

 

分析：此题为最近邻搜索的一个简单应用。下面给出我的实现代码：

 

 

#include <iostream> #include <vector> #include <cmath> #include <cfloat> #include <cstdio> using namespace std; struct color { int r, g, b; color( int r = 0, int g = 0, int b = 0 ) { this->r = r; this->g = g; this->b = b; } }; double dist_color( const color & c1, const color c2 ) { return sqrt( double( c1.r - c2.r ) * ( c1.r - c2.r ) + double( c1.g - c2.g ) * ( c1.g - c2.g ) + double( c1.b - c2.b ) * ( c1.b - c2.b ) ); } void color_mapping( const color & c, const vector<color> & color_table ) { double min_dist = DBL_MAX; int min_idx = 0; for( int i = 0; i < color_table.size(); ++i ) { double dist = dist_color( c, color_table[i] ); if( dist < min_dist ) { min_dist = dist; min_idx = i; } } const color & item = color_table[min_idx]; printf( "(%d,%d,%d) maps to (%d,%d,%d)/n", c.r, c.g, c.b, item.r, item.g, item.b ); } int main() { color c; vector<color> color_table; // read color table for( int i = 0; i < 16; ++i ) { cin >> c.r >> c.g >> c.b; color_table.push_back( c ); } // nearest neighbor mapping while( cin >> c.r >> c.g >> c.b ) { if( c.r == -1 || c.g == -1 || c.b == -1 ) break; color_mapping( c, color_table ); } return 0; }