标签：known action sts heap expect bre 技术分享 next name
http://train.usaco.org/usacoprob2?a=y0SKxY0Kc2q&S=gift1
给出不超过$10$个人,每个人拿出一定数量的钱平分给特定的人,求最后每个人的财产变化.
Task ‘gift1‘: 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:
determine how much money each person ends up with.
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, ‘\n‘ and ‘\r‘. Do not let your program get trapped by this!
| 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:
|
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
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.
dave 302 laura 66 owen -359 vick 141 amr -150
第二种写法貌似简短了些..
英文捉鸡QAQ
1 /* 2 TASK:gift1 3 LANG:C++ 4 Time:2018.5.11-21:24 5 */ 6 #include <bits/stdc++.h> 7 using namespace std; 8 9 const int maxn=10,maxm=14; 10 int n; 11 struct A{ 12 char name[maxm+5]; 13 int m=0; 14 }a[maxn+5]; 15 16 int main(){ 17 freopen("gift1.in","r",stdin); 18 freopen("gift1.out","w",stdout); 19 scanf("%d",&n); 20 for(int i=0;i<n;i++) scanf("%s",a[i].name); 21 for(int i=0;i<n;i++){ 22 char _x[maxm+5]; 23 int x,num,mon; 24 scanf("%s%d%d",_x,&mon,&num); 25 for(int j=0;j<n;j++) if(!strcmp(_x,a[j].name)){ 26 x=j; 27 break; 28 } 29 for(int j=0;j<num;j++){ 30 char _y[maxm+5]; 31 int y; 32 scanf("%s",_y); 33 for(int k=0;k<n;k++) if(!strcmp(_y,a[k].name)){ 34 y=k; 35 break; 36 } 37 int m=mon/num; 38 a[y].m+=m; 39 a[x].m-=m; 40 } 41 } 42 for(int i=0;i<n;i++) printf("%s %d\n",a[i].name,a[i].m); 43 return 0; 44 }
1 /* 2 TASK:gift1 3 LANG:C++ 4 Time:2018.5.11-21:35 5 */ 6 #include <bits/stdc++.h> 7 using namespace std; 8 9 const int maxn=10,maxm=14; 10 int n; 11 struct B{ 12 char name[maxm+5]; 13 int m=0; 14 }; 15 struct A{ 16 B b[maxn+5]; 17 B& operator [] (const char* name){ 18 for(int i=0;i<n;i++) if(!strcmp(name,b[i].name)) return b[i]; 19 } 20 B& operator [] (const int& i){ 21 return b[i]; 22 } 23 }a; 24 25 int main(){ 26 freopen("gift1.in","r",stdin); 27 freopen("gift1.out","w",stdout); 28 scanf("%d",&n); 29 for(int i=0;i<n;i++) scanf("%s",a[i].name); 30 for(int i=0;i<n;i++){ 31 char _x[maxm+5]; 32 int num,mon; 33 scanf("%s%d%d",_x,&mon,&num); 34 B& x=a[_x]; 35 for(int j=0;j<num;j++){ 36 char y[maxm+5]; 37 scanf("%s",y); 38 int m=mon/num; 39 a[y].m+=m; 40 x.m-=m; 41 } 42 } 43 for(int i=0;i<n;i++) printf("%s %d\n",a[i].name,a[i].m); 44 return 0; 45 }
USACO_1.1_Greedy_Gift_Givers_(模拟+水题)
标签：known action sts heap expect bre 技术分享 next name
原文地址：https://www.cnblogs.com/Sunnie69/p/9026785.html
