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, NP
Lines 2..NP+1: Each line contains the name of a group member
Lines 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)
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 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
分析:
The hardest part about this problem is dealing with the strings representing people's names.
We keep an array of Set structures that contain their name and how much money they give/get.
The heart of the program is the getID() function that, given a person's name, returns their Person's ID.
Note that we assume names are reasonably short.
/*
ID:xxfz014
PROG:gift1
LANG:C++
*/
#include <iostream>
#include <string>
#include <fstream>
using namespace std;
const int maxn=20;
struct node
{
string name;
int money;
node(string s="0",int a=0):name(s),money(a){}
}set[maxn];
int n;
int getID(string s)
{
for(int i=0;i<n;i++)
if(s==set[i].name) return i;
}
int main()
{
ifstream fin("gift1.in");
ofstream fout("gift1.out");
string s;
int a,b;
fin>>n;
//cin>>n;
for(int i=0;i<n;i++)
{
fin>>set[i].name;
//cin>>set[i].name;
set[i].money=0;
}
for(int i=0;i<n;i++)
{
fin>>s>>a>>b;
//cin>>s>>a>>b;
if(b==0) continue;
set[getID(s)].money-=a;
set[getID(s)].money+=a%b;
for(int j=0;j<b;j++)
{
fin>>s;
//cin>>s;
set[getID(s)].money+=a/b;
}
}
for(int i=0;i<n;i++)
{
fout<<set[i].name<<" "<<set[i].money<<endl;
//cout<<set[i].name<<" "<<set[i].money<<endl;
}
fin.close();
fout.close();
return 0;
}
分享到:
相关推荐
USACO题目,Greedy Gift Givers
2 [1.1] 贪婪的送礼者Greedy Gift Givers 3 [1.1] 黑色星期五Friday the Thirteenth 4 [1.1] 坏掉的项链 Broken Necklace 5 [1.2] 命名那个数字 Name That Number 6 [1.2] 挤牛奶Milking Cows 7 [1.2] 方块转换 ...
Chapter 1 Section 1.1 Greedy Gift Givers (gift1) 这道题的难度相当于联赛第一题。使用数组 incom 和 outcom 记录每个人的收入和支出,对于送礼人 i,找到他要送给的人 j,inc(incom[j],outcom[i] div n),其中 n...
greedy_c源程序greedy_c源程序greedy_c源程序
贪吃蛇小游戏,闲的无聊可以下来玩玩,哈哈。由于java编写,所以需要 jre 环境噢,电脑装了java的都有此环境。纯手打,java开发,学习开发全流程见 ...
windows 32位汇编语言编写的贪吃蛇项目,双击目录下的Debug下的Greedy snake.exe即可运行。可以使用visial studio打开项目。大概用了600行代码。
greedy-snake 贪吃蛇小游戏
算法课的课件,详细的介绍了greedy algorithm的思想,通俗易懂的例子,英文课件
greedy algorithm is a source data
et al recently introduced a greedy layer wise unsupervised learning algorithm for Deep Belief Networks DBN a generative model with many layers of hidden causal variables In the context of the above ...
a snake that is so greedy,and if it can,it will eat itself
3个关于greedy算法的经典实例,不过是英文的,老外讲的挺细的
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the po- sitions of routers and a packet's destination to make packet for- ...
Dynamic analysis of multiagent Q-learning with ε-greedy exploration
GREEDY FUNCTION APPROXIMATION- A GRADING BOOSTING MACHINE.pdf
Greedy Layer-Wise Training of Deep Networks
关于数据记录中的贪心算法
A Fast Greedy Algorithm for Outlier Mining,何增友,,The task of outlier detection is to find small groups of data objects that are exceptional when compared with rest large amount of data....
计算机贪心算法,介绍了贪心算法的基本概念,全英文版 DR. ranka
C语言编写,环境Visual Studio 2019。运行之后按wsad来控制方向。本代码功能一个简易界面加一条贪吃蛇,其余功能可以自行加入。