P1201 [USACO1.1] Greedy Gift Givers

A group of $NP$ uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not give some money to some or all of the other friends (although some might be cheap and give to no one). Likewise, each friend might or might not receive money from any or all of the other friends. Your goal is to deduce how much more money each person receives than they give. The rules for gift-giving are potentially different than you might expect. Each person goes to the bank to get 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 $7$ among $2$ friends would be $3$ each for the friends with $1$ left over. That $1$ left over goes into the giver's account. All the participants' gift accounts start at $0$ and are decreased by money given and increased by money received. In any group of friends, some people are more giving than others 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 list of friends to whom each person gives gifts, Determine how much money each person ends up with. ## 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 characters, `\r` and `\n`. Do not let your program get trapped by this.

- Line 1: A single integer, $NP$. - Line 2..$NP+1$: Line $i+1$ contains the name of group member $i$. - Line $NP+2$..end: $NP$ groups of lines organized like this: The first line of each group tells the person's name who will be giving gifts. The second line in the group contains two numbers: - the amount of money (in the range $0..2000$) to be divided into gifts by the giver - $NG_i$ ($0 \le NG_i \le NP$), the number of people to whom the giver will give gifts If $NG_i$ is nonzero, each of the next $NG_i$ lines lists the name of a recipient of a gift; recipients are not repeated in a single giver's list.

The output is $NP$ lines, each with the name of a person followed by a single blank followed by the net gain or loss $\text{final\_money\_value}-\text{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.

## Output Explanation Five names: dave, laura, owen, vick, amr. First, dave splits $200$ among laura, owen, and vick. That comes to $66$ each, with $2$ left over. Second, owen gives $500$ to dave. Third, amr splits $150$ between vick and owen. Fourth, laura splits $0$ between amr and vick, so no changes. Finally, vick gives $0$ to no one. USACO Training Section 1.1.