usaco Greedy Gift Givers (送礼物)
来源:互联网 发布:淘宝上海摄友数码如何 编辑:程序博客网 时间:2024/04/30 15:08
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 any or all of the other friends. Likewise, each friend might or might not receive money from any or all of the other friends. Your goal in this problem is to deduce how much more money each person gives than they receive.
The rules for gift-giving are potentially different than you might expect. Each person sets aside 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 3 among 2 friends would be 1 each for the friends with 1 left over -- that 1 left over stays in the giver's "account".
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 more (or less) each person in the group gives than they receive.
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 charcters, '\n' and '\r'. Do not let your program get trapped by this!
PROGRAM NAME: gift1
INPUT FORMAT
Line 1:The single integer, NPLines 2..NP+1:Each line contains the name of a group memberLines NP+2..end:NP groups of lines organized like this:The first line in the group tells the person's name who will be giving gifts.The second line in the group contains two numbers: The initial amount of money (in the range 0..2000) to be divided up into gifts by the giver and then the number of people to whom the giver will give gifts, NGi (0 ≤ NGi ≤ NP-1).If NGi is nonzero, each of the next NGi lines lists the the name of a recipient of a gift.SAMPLE INPUT (file gift1.in)
5davelauraowenvickamrdave200 3lauraowenvickowen500 1daveamr150 2vickowenlaura0 2amrvickvick0 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 302laura 66owen -359vick 141amr -150
OUTPUT EXPLANATION
Five names: dave, laura, owen, vick, amr Let's keep a table of the gives (money) each person 'has':davelauraowenvickamr00000First, 'dave' splits 200 among 'laura', 'owen', and 'vick'. That comes to 66 each, with 2 left over-200+26666660Second, 'owen' gives 500 to 'dave':-198+5006666-500660Third, 'amr' splits 150 between 'vick' and 'owen':30266-434+7566+75-150Fourth, 'laura' splits 0 between 'amr' and 'vick'; no changes:30266-359141-150Finally, 'vick' gives 0 to no one:davelauraowenvickamr30266-359141-150/** PROG:gift1 LANG:C++ ID:zpc19951 **/#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<map>#include<string>using namespace std;int main(){freopen("gift1.in","r",stdin);freopen("gift1.out","w",stdout);map<string,int>ans; map<int,string>index;int n,m,i,j,money,num;string name;cin>>n;for(i=1;i<=n;i++) {cin>>index[i];ans[index[i]]=0;}int loop1=n;while(loop1--) {cin>>name;cin>>money>>num;ans[name]-=money;if(num)ans[name]+=money%num;int loop2=num;while(loop2 --) {cin>>name;ans[name]+=money/num;}}for(i=1;i<=n;i++) cout<<index[i]<<" "<<ans[index[i]]<<endl;return 0;}
- usaco Greedy Gift Givers (送礼物)
- USACO——Greedy Gift Givers 贪婪的送礼者
- USACO 1.1 贪婪的送礼者Greedy Gift Givers
- Greedy Gift Givers(USACO)
- usaco--Greedy Gift Givers
- [USACO] Greedy Gift Givers
- USACO-----Greedy Gift Givers
- USACO | Greedy Gift Givers
- USACO->Greedy Gift Givers
- Usaco 1.1.2 贪婪的送礼者(Greedy Gift Givers)
- USACO 1.1-Greedy gift givers
- usaco 1.1:Greedy Gift Givers
- usaco Greedy Gift Givers 字符串
- USACO 1.1 Greedy Gift Givers
- usaco之greedy gift givers
- usaco Greedy Gift Givers 报告
- usaco 1.1 greedy gift givers
- usaco/1.1 Greedy Gift Givers
- C# 获取namespace的方法
- Zookeeper + HBase 安装(详细图文)
- EhCache配置文件
- 信令的基本概念
- AVL树(平衡二叉树)的构造
- usaco Greedy Gift Givers (送礼物)
- 缓存之EHCache(一)
- WIN10如何使用Free Pascal 解决乱码等不兼容问题
- 蓝桥杯-特殊回文数(基础练习)
- 缓存之EHCache(二)
- 半导体超级交易即将诞生,恩智浦却不是高通的最佳选择
- Python入门笔记2 序列(字符串、元组、列表)
- opencv之IplImage图片显示
- HDU 4614 Vases and Flowers (线段树)