USACO Training - (Section 1.2) Greedy Gift Givers -Python-
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 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 (or any other source of money) 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 (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 money each person ends up with.
INPUT FORMAT
Line # | Contents | |||
---|---|---|---|---|
1 | A single integer, NP | |||
2..NP+1 | Line i+1 contains the name of group member i | |||
NP+2..end | NP groups of lines organized like this:
|
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
SAMPLE OUTPUT (file gift1.out)
dave 302
laura 66
owen -359
vick 141
amr -150
OUTPUT EXPLANATION
dave | laura | owen | vick | amr |
0 | 0 | 0 | 0 | 0 |
First, 'dave' splits 200 among 'laura', 'owen', and 'vick'. That comes to 66 each, with 2 left over | ||||
-200+2 | +66 | +66 | +66 | 0 |
→ | ||||
-198 | 66 | 66 | 66 | 0 |
Second, 'owen' gives 500 to 'dave': | ||||
-198+500 | 66 | 66-500 | 66 | 0 |
→ | ||||
302 | 66 | -434 | 66 | 0 |
Third, 'amr' splits 150 between 'vick' and 'owen': | ||||
302 | 66 | -434+75 | 66+75 | -150 |
→ | ||||
302 | 66 | -359 | 141 | -150 |
Fourth, 'laura' splits 0 between 'amr' and 'vick'; no changes: | ||||
302 | 66 | -359 | 141 | -150 |
Finally, 'vick' gives 0 to no one: | ||||
dave | laura | owen | vick | amr |
302 | 66 | -359 | 141 | -150 |
Answer - Python
fin = open('gift1.in','r')
np = int(fin.readline().strip())
dictOfMoney = { fin.readline().strip() : 0 for i in range(np) }
while(True):
giver = fin.readline().strip()
if(giver==""):
break
amount, divided = map(int, fin.readline().strip().split())
receivers = [fin.readline().strip() for i in range(divided)]
try:
quotient, remainder = divmod(amount,divided)
except:
quotient = remainder = 0
for receiver in receivers:
dictOfMoney[receiver] += quotient
dictOfMoney[giver] += -amount + remainder
with open('gift1.out','w') as fout:
for name, money in dictOfMoney.items():
fout.write(f"{name} {money}\n")
Leave a comment