Chapter 1:2.Greedy Gift Givers

原创 2008年10月01日 17:21:00
 

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
附源代码:
/*
ID: Ritain He
PROG: gift1
LANG: C++
*/
#include<iostream>
#include<fstream>
#include<string>
using namespace std;
struct Friend
{
   string name;
   int initMoney;       //the person's initial money
   int getMoney;        //one's total money,include remains
};
ifstream fin("gift1.in");
ofstream fout("gift1.out");
int main()
{
    Friend *frArr;
    int n,i,give;
   
    fin>>n;
    frArr = new Friend[n];
   
    for(i=0;i<n;i++)
    {//get the data from the file
        fin>>frArr[i].name;
        frArr[i].getMoney = 0;
    }   
   
    string name;
    //int loop = 1;
    for(i=0;i<n;i++)
    {
        int j,money,num,get,gm;
        fin>>name;
        for(give=0;name != frArr[give].name;give++);
       
        fin>>frArr[give].initMoney>>num;        //get the person's initMoney and number of whom he will give gift
       
        if(0 == num)
                continue;
        money = frArr[give].initMoney;
        gm = money/num;
        frArr[give].getMoney = frArr[give].getMoney + money - num * gm;  //calculate the giving gift person's remain money
        //cout<<loop++<<":"<<endl;       
        for(j=0;j<num;j++)
        {//add everyone's get money one by one
            fin>>name;
            for(get=0;name != frArr[get].name;get++);
           
            frArr[get].getMoney += gm;
            //cout<<money/num<<frArr[get].name<<frArr[get].getMoney<<endl;
        }   
    }   
   
    for(i=0;i<n;i++)            //output the resulr
        fout<<frArr[i].name<<" "<<frArr[i].getMoney - frArr[i].initMoney<<endl;
   
    delete[] frArr;
    //system("Pause");
    return 0;  
}
                

usaco 1-1-2 Greedy Gift Givers

usaco 持续更新中。 nocow友情翻译: 描述 对于一群NP(2 [编辑]格式 PROGRAM NAME: gift1 INPUT FORMAT: (file gift1.i...
  • shuiti_ac_ji
  • shuiti_ac_ji
  • 2016年03月03日 13:16
  • 215

USACO1.1.2 Greedy Gift Givers (gift1)

用map存每个人收到多少钱 不能给出的钱算自己的收入。 /* ID:shijiey1 PROG:gift1 LANG:C++ */ #include #include #include...
  • u011265346
  • u011265346
  • 2014年12月10日 08:03
  • 263

[USACO1.1]贪婪的送礼者Greedy Gift Givers

题目: 对于一群(NP个)要互送礼物的朋友,GY要确定每个人送出的钱比收到的多多少。在这一个问题中,每个人都准备了一些钱来送礼物,而这些钱将会被平均分给那些将收到他的礼物的人。然而,在任何一群朋友...
  • qq_35124363
  • qq_35124363
  • 2017年02月02日 11:57
  • 159

UVA Greedy Gift Givers

Greedy Gift Givers A group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gif...
  • jimzhai
  • jimzhai
  • 2013年01月28日 21:12
  • 835

USACO 1.1.2 Greedy Gift Givers (gift1)

容易忽略除数不能为零这个条件!/* ID: gengjia1 LANG: C TASK: gift1 */ #include #include #include #include...
  • Gavin_dinggengjia
  • Gavin_dinggengjia
  • 2010年12月17日 18:50
  • 955

vijos 1035 贪婪的送礼者

额,把题目读懂应该没问题,虽然繁琐,但难度不大. #include #include using namespace std; struct stu { string nam; int old...
  • zafkiel_nightmare
  • zafkiel_nightmare
  • 2015年02月14日 21:58
  • 545

UVA 119.Greedy Gift Givers

题意:每个人的钱尽可能多的花掉,剩下的当做自己的收入.题目求得是每个人的纯收入,即1.从朋友那里得到的加上自己剩余的.2.如果朋友为0(没有送给任何人),则这部分钱不算自己的收入. 注意:每个输入组的...
  • zsjhxl
  • zsjhxl
  • 2013年11月03日 09:58
  • 237

USACO1.1.2[Greedy Gift Givers]

亦为白菜题,直接模拟.{ID:idontknowPROG:gift1LANG:PASCAL}var    j, cash, num, i, hash, np : longint;    na : ar...
  • wo4sbOYE
  • wo4sbOYE
  • 2008年08月02日 17:19
  • 108

Analysis:Greedy Gift Givers

The hardest part about this problem is dealing with the strings representing peoples names. We keep...
  • billoshi
  • billoshi
  • 2007年04月19日 22:48
  • 211

[USACO] Greedy Gift Givers

这道题也不难,把题目读透,把例子自己走一遍就OK了。实现上,就是读取数据出了一点儿错,最开始我用fgets()读结果读到了‘/n’‘/0’这样的字符串,最后改用fscanf就好了,它会跳过white ...
  • philips123
  • philips123
  • 2011年02月21日 20:13
  • 356
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Chapter 1:2.Greedy Gift Givers
举报原因:
原因补充:

(最多只允许输入30个字)