USACO1.1.2 Greedy Gift Givers 贪婪的送礼者

一.题目要求

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

二.编程思路以及遇到的障碍

本题关键是对于具体是哪个人的判定，由于不管是giver还是receiver都涉及到了这个判定，所以选择写一个函数来find the number

还有就是创建一个数据结构来存储每个人的名字 收入 支出信息，会比较方便

最开始写出来的那份超时了，发现是自己把逻辑理解错误了，明明应该是几个人都进行给予得到操作，也就是说循环次数应该为num，然后我理解成了判断终止条件为givenum=0，就错的很离谱

然后还有个问题就是比较啰嗦，明明一步能完的操作偏偏多写几步，在循环里是很容易超时的啊！！！

三.代码

 /*
 ID:grj11292
 PROG:gift1
 LANG:C++
 */


 #include<iostream>
 #include<fstream>
 #include<cstring>
 using namespace std;


 struct person
 {
     char name[15];
     int give;
     int receive;
 };
 person per[10];


 int findNum(char *N,int num);


 int main()
 {
     ifstream fin("gift1.in");
     ofstream fout("gift1.out");
     int num;
     fin>>num;
     for(int i=0;i<num;++i)
     {
         fin>>per[i].name;
         per[i].give=per[i].receive=0;
     }


     char tmpper[15];
     int giveAmount,giveNum;


     for(int n=0;n<num;++n)
     {
         fin>>tmpper;
         fin>>giveAmount;
         fin>>giveNum;
         if(giveNum!=0)per[findNum(tmpper,num)].give+=giveAmount/giveNum*giveNum;


         for(int i=0;i<giveNum;++i)
         {
             fin>>tmpper;
             per[findNum(tmpper,num)].receive+=giveAmount/giveNum;
         }
     }
     for(int i=0;i<num;++i)fout<<per[i].name<<' '<<per[i].receive-per[i].give<<endl;


     fin.close();
     fout.close();
     return 0;
 }


int findNum(char *N,int num)
{
    int theNum=-1;
    int flag;
    for(int i=0;i<num;++i)
    {
        flag=0;
        if(strlen(N)!=strlen(per[i].name))continue;
        for(int j=0;j<strlen(N);++j)
        {
            if(N[j]!=per[i].name[j]){flag=1;break;}
        }
        if(flag)continue;
        theNum=i;
        break;
    }
    return theNum;
}