USACO Section1.1 Greedy Gift Givers

关注

原创最新推荐文章于 2026-02-27 13:48:23 发布 347 阅读 AI 写同款· GEO 优化 ›

USACO-Section1.1 Greedy Gift Givers 2017-05-25题目大意：对于一群（NP个）要互送礼物的朋友，GY要确定每个人送出的钱比收到的多多少。在这一个问题中，每个人都准备了一些钱来送礼物，而这些钱将会被平均分给那些将收到他的礼物的人。然而，在任何一群朋友中，有些人将送出较多的礼物(可能是因为有较多的朋友)，有些人有准备了较多的钱。给出一群朋友，没有人的名字会长于 14 字符，给出每个人将花在送礼上的钱，和将收到他的礼物的人的列表阅读详情

第一次用这个网站的看USACO分类的“关于USACO“，，肯定有用，不然你会死在某些你想吐血的地方

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 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.

SAMPLE OUTPUT (file gift1.out)
dave 302
laura 66
owen -359
vick 141
amr -150

OUTPUT EXPLANATION
Five names: dave, laura, owen, vick, amr Let’s keep a table of the gives (money) each person ‘has’:
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
Second, ‘owen’ gives 500 to ‘dave’:
-198+500 66 66-500 66 0
Third, ‘amr’ splits 150 between ‘vick’ and ‘owen’:
302 66 -434+75 66+75 -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

中文题目
Greedy Gift Givers
贪婪的礼物送礼者
译 by tim green
对于一群要互送礼物的朋友，你要确定每个人送出的礼物比收到的多多少(and vice versa for those who view gift giving with cynicism)。
在这一个问题中，每个人都准备了一些钱来送礼物，而这些钱将会被平均分给那些将收到他的礼物的人。
然而，在任何一群朋友中，有些人将送出较多的礼物(可能是因为有较多的朋友)，有些人有准备了较多的钱。
给出一群朋友，没有人的名字会长于 14 字符，给出每个人将花在送礼上的钱，和将收到他的礼物的人的列表，
请确定每个人收到的比送出的钱多的数目。
IMPORTANT NOTE
测试系统是 Linux 符合标准的 Unix 的协定。
用’\n’作为行的结束。
这和　Windows 系统用’\n’ 和 ‘\r’作为行的结束是不同的。
你的程序不要被这困住了。
PROGRAM NAME: gift1
INPUT FORMAT
第 1 行: 人数NP,2<= NP<=10
第 2到 NP+1 行: 这NP个在组里人的名字　一个名字一行
第NP＋2到最后：这里的NP段内容是这样组织的：
第一行是将会送出礼物人的名字。
第二行包含二个数字:　第一个是原有的钱的数目（在0到2000的范围里），第二个NGi是将收到这个送礼者礼物的人的个数如果 NGi 是非零的, 在下面 NGi 行列出礼物的接受者的名字，一个名字一行。

【解题思路】用map来记录名字，，，我以为输出可以用迭代器从begin()到end(),,,然而还不料，万恶的平衡树，。。。只能存了

/*
ID：***
LANG:C++
TASK:gift1 
*/
#include<iostream>
#include<cstdio>
#include<map>
#include<string>
using namespace std;
map<string,int>mp;
map<string,int>::iterator it;
int tot;
string ss[12];
inline void read(int i){
    string s;
    cin>>s;
    ss[i]=s;
    mp[s]=++tot;
}
inline int readin(){
    string s;
    cin>>s;
    return mp[s];
}
int n,m;
int w[15];
int main(){
    freopen("gift1.in","r",stdin);
    freopen("gift1.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1; i<= n; i++)
        read(i);
    for(int i = 1; i<= n; i++){
        int u=readin(),ww;
        scanf("%d%d",&ww,&m);
        if(m==0){w[u]+=ww;continue;}
        int q=ww/m;
        w[u]+=-q*m;
        for(int j = 1; j<=m; j++){
            int v=readin();
            w[v]+=q;
        }
    }
    for(int i = 1; i <= n; i++)
        cout<<ss[i]<<" "<<w[mp[ss[i]]]<<endl;
    return 0;
}