Painter (p2709)
来源:互联网 发布:儿童台灯 知乎 编辑:程序博客网 时间:2024/05/16 08:35
题意: 给定有几种颜色,然后给定相应颜色的需求,然后给定灰色颜色的要求。
其中,灰色可以用随意的三种不同颜色的体积分别为m,m,m来合成灰色的颜料的体积为m。
做法:先找到每个颜色要求的量。再用灰色的量一个一个降低。如果该量不够,就再加一套颜料
#include<iostream>#include<cstdio>#include<algorithm>#include<queue>#include<vector>#include<cmath>#include<set>#include<cstdlib>#include<cstring>#include<stack>#include<string>using namespace std;int need[22],left[22],gray,N;int n;bool cmp(int a,int b){return a>b;}int main(){freopen("C://i.txt","r",stdin);int i,j,k;while (cin>>n,n){//cout<<n<<endl;int big=0;for (i=0;i<n;i++){cin>>need[i];big=max(big,need[i]);}cin>>gray;int ans=0;ans=big/50;if (big%50){ans++;}for (i=0;i<n;i++){need[i]=ans*50-need[i];}while (gray--){sort(need,need+n,cmp); //重要。。保持优先性。need[0]--;need[1]--;need[2]--;if (need[0]<0||need[1]<0||need[2]<0){ans++;for (i=0;i<n;i++){need[i]+=50;}}}cout<<ans<<endl;}}
Painter
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2328 Accepted: 1451
Description
The local toy store sells small fingerpainting kits with between three and twelve 50ml bottles of paint, each a different color. The paints are bright and fun to work with, and have the useful property that if you mix X ml each of any three different colors, you get X ml of gray. (The paints are thick and "airy", almost like cake frosting, and when you mix them together the volume doesn't increase, the paint just gets more dense.) None of the individual colors are gray; the only way to get gray is by mixing exactly three distinct colors, but it doesn't matter which three. Your friend Emily is an elementary school teacher and every Friday she does a fingerpainting project with her class. Given the number of different colors needed, the amount of each color, and the amount of gray, your job is to calculate the number of kits needed for her class.
Input
The input consists of one or more test cases, followed by a line containing only zero that signals the end of the input. Each test case consists of a single line of five or more integers, which are separated by a space. The first integer N is the number of different colors (3 <= N <= 12). Following that are N different nonnegative integers, each at most 1,000, that specify the amount of each color needed. Last is a nonnegative integer G <= 1,000 that specifies the amount of gray needed. All quantities are in ml.
Output
For each test case, output the smallest number of fingerpainting kits sufficient to provide the required amounts of all the colors and gray. Note that all grays are considered equal, so in order to find the minimum number of kits for a test case you may need to make grays using different combinations of three distinct colors.
Sample Input
3 40 95 21 07 25 60 400 250 0 60 0 5004 90 95 75 95 104 90 95 75 95 115 0 0 0 0 0 3330
Sample Output
28234
Source
- Painter (p2709)
- Painter
- Painter
- [P2709]小B的询问
- 洛谷P2709 小B的询问
- P2709 小B的询问(莫队)
- 【洛谷P2709】小B的询问
- luogu P2709 小B的询问
- poj2709 Painter
- HDU5319.Painter
- hdu5319 Painter
- hdu5319 Painter
- String painter
- HDU5319 Painter
- 【POJ】Painter
- String painter
- String painter
- .NET System Brushes Painter
- PostgreSQL9.0新特性介绍: alter default privileges,解决只读用户的问题
- getTime 方法
- Asp.net-UpdatePanel异步刷新后JS失效的解决方法
- 实体、协议、服务和服务访问点汇编
- Oracle安装目录及主要文件介绍
- Painter (p2709)
- html 多行输入框
- 我对中断处理程序是异步运行的理解
- java实现根据文件最后的修改时间排序
- 计算一个整数中含1的比特数
- 一线网页游戏程序员日志 (二十一)
- 一种字符串相似性度量的方法
- 如何才算掌握了Java EE?
- Intent应用详解