usaco 1.1 PROB Greedy Gift Givers 解题报告
来源:互联网 发布:淘宝充值未到账怎么办 编辑:程序博客网 时间:2024/06/05 19:11
题目:
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 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分析:
模拟,主要是熟悉一下文件操作格式。
代码:
/*ID: limingl1PROG: gift1LANG: C++*/#include <iostream>#include <string>#include <fstream>#include <limits.h> using namespace std;struct Node{string people ;int money ;}node[11];int amount ,NG ,NP ;inline int finder (string name){for (int i=0; i<NP; i++){if (name == node[i].people){return i ;}}return INT_MAX ;}int main(){ ofstream out ("gift1.out"); ifstream in ("gift1.in");in >> NP ;for (int i=0; i<NP; i++){in >> node[i].people ;node[i].money = 0 ;}for (int x =NP; x>0; x--){string inputName ;in >> inputName ;int senderNumber = finder (inputName) ;in >> amount ;in >> NG ;for (int i=0; i<NG; i++){in >> inputName ;int giverNumber = finder (inputName);node[senderNumber].money -= int(amount / NG);node[giverNumber].money += int(amount / NG);}}for(int i=0; i<NP; i++){out << node[i].people << " " << node[i].money << endl;}return 0;}
- usaco 1.1 PROB Greedy Gift Givers 解题报告
- USACO之Section 1.1.2 PROB Greedy Gift Givers
- usaco Greedy Gift Givers 报告
- USACO Problem 77:Greedy Gift Givers解题报告
- Section 1.1 PROB Greedy Gift Givers
- USACO 1.1-Greedy gift givers
- usaco 1.1:Greedy Gift Givers
- USACO 1.1 Greedy Gift Givers
- usaco 1.1 greedy gift givers
- usaco/1.1 Greedy Gift Givers
- USACO 1.1 Greedy Gift Givers
- USACO 1.1 Greedy Gift Givers
- USACO 1.1 Greedy Gift Givers
- USACO 1.1 Greedy Gift Givers
- USACO Greedy Gift Givers 解题日志
- 自己的usaco代码---PROB Greedy Gift Givers
- Greedy Gift Givers(USACO)
- usaco--Greedy Gift Givers
- HDU3694 Fermat Point in Quadrangle 多边形费马点结论
- 一起学Google Daydream VR开发,快速入门开发基础教程二:Android端开发环境配置二
- 链表(10月3号学习总结)
- POJ 1523 SPF(无向图求割点,去割点形成子图数)
- 简单的多线程数据传输
- usaco 1.1 PROB Greedy Gift Givers 解题报告
- Java-获取网络资源大小
- 基于RollPagerView实现图片轮播功能
- Redis 一:Linux下 安装Redis并配置服务
- Java + 对象的聚合例子(计算三角形、圆形的面积)
- 用递归函数实现字符串反向输出
- PHP Webservice简单实例
- core_animation_lesson0
- 网易邮箱的JS插件被AdBlock广告屏蔽插件拦截,导致无法显示邮件图片