最新消息:点击查看大S的省钱秘笈

POJ 1547 Clay Bully C++版

POJ题解 Slyar 49浏览 0评论

文章作者:姜南(Slyar) 文章来源:Slyar Home (www.slyar.com) 转载请注明,谢谢合作。

水题,不过尝试了一下STL的map,很爽。

Description

Ms. Terry is a pre-school art teacher who likes to have her students work with clay. One of her assignments is to form a lump of clay into a block and then measure the dimensions of the block. However, in every class, there is always one child who insists on taking some clay from some other child. Since Ms. Terry always gives every child in a class the same amount of clay to begin with, you can write a program that helps Ms. Terry find the bully and victim after she measures each child's finished block.

Input

There are one or more classes of students, followed by a final line containing only the value -1. Each class starts with a line containing an integer, n, which is the number of students in the class, followed by n lines of student information. Each line of student information consists of three positive integers, representing the dimensions of the clay block, followed by the student's first name. There can never be more than 9 students nor less than 2 students in any class. Each student's name is at most 8 characters. Ms. Terry always gives each student at most 250 cubic units of clay. There is exactly one bully and one victim in each class.

Output

For each class print a single line exactly as shown in the sample output.

Sample Input

3
10 10 2 Jill
5 3 10 Will
5 5 10 Bill
4
2 4 10 Cam
4 3 7 Sam
8 11 1 Graham
6 2 7 Pam
-1

Sample Output

Bill took clay from Will.
Graham took clay from Cam.

Slyar:看完这道题我就觉得可以用map来搞,这也是我第一次用map啊,哈哈...题意其实很简单了,3个整数是长宽高,然后你把体积求出来,打印体积最大的那个人和最小的那个人就行了。因为题中说最大和最小的恰好只有一个人,这样就可以使用体积来做键了,这样即使insert无法插入键相同的元素也不会影响我们,嘿嘿...

记录一下使用map的心得。map是<键,值>对的,而且键必须唯一,使用insert的时候map会自动按键的大小按升序插入到合适的位置,可以使用rbegin()访问到最后一个键值对...其他的还没发现,继续学习中...

转载请注明:Slyar Home » POJ 1547 Clay Bully C++版

发表我的评论
取消评论

表情

Hi,您需要填写昵称和邮箱!

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址