题面


Task 'gift1': Greedy Gift Givers

A group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not give some money to some or all of the other friends (although some might be cheap and give to no one). Likewise, each friend might or might not receive money from any or all of the other friends. Your goal is to deduce how much more money each person receives than they give.

The rules for gift-giving are potentially different than you might expect. Each person goes to the bank (or any other source of money) to get a certain amount of money to give and divides this money evenly among all those to whom he or she is giving a gift. No fractional money is available, so dividing 7 among 2 friends would be 3 each for the friends with 1 left over – that 1 left over goes into the giver's "account". All the participants' gift accounts start at 0 and are decreased by money given and increased by money received.

In any group of friends, some people are more giving than others (or at least may have more acquaintances) and some people have more money than others.

Given:

  • a group of friends, no one of whom has a name longer than 14 characters,
  • the money each person in the group spends on gifts, and
  • a (sub)list of friends to whom each person gives gifts,

determine how much money each person ends up with.

IMPORTANT NOTE

The grader machine is a Linux machine that uses standard Unix conventions: end of line is a single character often known as '\n'. This differs from Windows, which ends lines with two characters, '\n' and '\r'. Do not let your program get trapped by this!

PROGRAM NAME: gift1

INPUT FORMAT

Line # Contents
1 A single integer, NP
2..NP+1 Line i+1 contains the name of group member i
NP+2..end NP groups of lines organized like this:

The first line of each group tells the person's name who will be giving gifts.
The second line in the group contains two numbers:

  • The amount of money (in the range 0..2000) to be divided into gifts by the giver
  • NGi (0 ≤ NGi ≤ NP), the number of people to whom the giver will give gifts
If NGi is nonzero, each of the next NGi lines lists the name of a recipient of a gift; recipients are not repeated in a single giver's list.

SAMPLE INPUT (file gift1.in)

5
dave
laura
owen
vick
amr
dave
200 3
laura
owen
vick
owen
500 1
dave
amr
150 2
vick
owen
laura
0 2
amr
vick
vick
0 0

OUTPUT FORMAT

The output is NP lines, each with the name of a person followed by a single blank followed by the net gain or loss (final_money_value - initial_money_value) for that person. The names should be printed in the same order they appear starting on line 2 of the input.

All gifts are integers. Each person gives the same integer amount of money to each friend to whom any money is given, and gives as much as possible that meets this constraint. Any money not given is kept by the giver.

SAMPLE OUTPUT (file gift1.out)

dave 302
laura 66
owen -359
vick 141
amr -150

OUTPUT EXPLANATION

Five names: dave, laura, owen, vick, amr. Let's keep a table of the gives (money) each person 'has':

dave laura owen vick amr
0 0 0 0 0
First, 'dave' splits 200 among 'laura', 'owen', and 'vick'. That comes to 66 each, with 2 left over
-200+2 +66 +66 +66 0
-198 66 66 66 0
Second, 'owen' gives 500 to 'dave':
-198+500 66 66-500 66 0
302 66 -434 66 0
Third, 'amr' splits 150 between 'vick' and 'owen':
302 66 -434+75 66+75 -150
302 66 -359 141 -150
Fourth, 'laura' splits 0 between 'amr' and 'vick'; no changes:
302 66 -359 141 -150
Finally, 'vick' gives 0 to no one:
dave laura owen vick amr
302 66 -359 141 -150

题意


最新文章

  1. Images.xcassets不能获取图片路径
  2. python gettitle v2.0
  3. Android学习笔记⑥——UI组件的学习ImageView相关
  4. 1002 GTY's birthday gift
  5. Centos5.5内核升级
  6. 【转】NPAPI 插件无法在 Chrome 42 版及更高版本上正常运行
  7. Ajax:Cross-Origin Resource Sharing(转)
  8. es3中使用es6/7的字符串扩展
  9. javaweb-2-Tomcat初步学习与使用
  10. 如何成为快手尬舞王?HUAWEI HiAI了解一下!
  11. Linux磁盘 - fdisk,partprobe, mkfs, mke2fs, fsck, badblocks, mount, mknod
  12. MATLAB与C语言对比实例:随机数生成
  13. hibernate多对多 一对多 及简单入门 主键生成策略
  14. maven项目板块的pom.xml配置
  15. vs2015 加载项目的时启动:无法启动 IIS Express Web 服务器
  16. 获取对象属性值=NPOI EXPORT
  17. 用yield 实现协程 (包子模型)
  18. 解决MySQL联表时出现字符集不一样
  19. 《驱蚊神器v1.0》android应用 赶走那些烦人的臭蚊子
  20. 自平衡二叉(查找树/搜索树/排序树) binary search tree

热门文章

  1. 案例_(单线程)使用xpath爬取糗事百科
  2. linux+jenkins+postman持续集成
  3. {每日一题}:tcp协议实现简单的文件下载器(单任务版)
  4. ASP.NET Core 使用 JWT 自定义角色/策略授权需要实现的接口
  5. 达孚电子(NDF)参加2019年印度电子元器件展圆满成功
  6. Jedis运用scan删除正则匹配的key
  7. 面试又被 Java 基础难住了?推荐你看看这篇文章。
  8. Kafka Manager安装部署及使用
  9. Django之多对多表之through第三张表之InlineModelAdmin后台内嵌
  10. Java HashMap底层实现原理源码分析Jdk8