poj 1046 Color Me Less -- 模拟
来源:互联网 发布:mac在u盘新建文件夹 编辑:程序博客网 时间:2024/05/29 03:15
Color Me Less
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32942 Accepted: 16006
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.
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)#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;struct point{ int r,g,b;}p[20];int main(){int x,y,z,i,ans,t;for(i=0;i<16;i++)scanf("%d %d %d",&p[i].r,&p[i].g,&p[i].b);while(~scanf("%d %d %d",&x,&y,&z)){if(x==-1&&y==-1&&z==-1)break;int minn = 255*255*255;t=0;for(i=0;i<16;i++){ans = (p[i].r-x)*(p[i].r-x)+(p[i].g-y)*(p[i].g-y)+(p[i].b-z)*(p[i].b-z);if(ans < minn){t = i;minn = ans;}}printf("(%d,%d,%d) maps to (%d,%d,%d)\n",x,y,z,p[t].r,p[t].g,p[t].b);}return 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)
模拟题目
0 0
- poj 1046 Color Me Less -- 模拟
- Color Me Less--poj--1046
- POJ 1046 Color Me Less
- poj 1046(Color Me Less)
- 1046 poj Color Me Less
- poj 1046 Color Me Less
- <poj 1046>Color Me Less
- poj 1046 Color Me Less
- POJ 1046 Color Me Less
- POJ 1046 Color Me Less
- Color Me Less POJ - 1046
- poj 1046 Color Me Less
- POJ 1046 Color Me Less
- POJ 1046 Color Me Less(浅水)
- [ACM] POJ 1046 Color Me Less
- POJ 1046 Color Me Less(水~)
- poj 1046 Color Me Less 解题报告
- POJ 1046-Color Me Less【暴力】
- 基础知识(十三)dlib python人脸检测 特征点定位
- python 爬虫实战--登陆学校教务系统获取成绩信息
- hdu3081 二分+并查集+最大流
- 四种简略的拓宽51单片机中断的妙招!
- android parcelable序列化成字符串
- poj 1046 Color Me Less -- 模拟
- vijos1020—切蛋糕
- 《Effective java》读书笔记-(三)
- Ubuntu 12.04.1 mysql从5.5升级到5.6
- php htmlentities和htmlspecialchars 的区别
- java线程深度解析(二)——线程互斥技术与线程间通信
- Hadoop实战【一、HDFS】
- 糊涂窗口综合症
- 向本地的apache服务器上传文件