EOJ(排序)——1182. Relative Relatives

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_29978597/article/details/86164438

1182. Relative Relatives

Today is Ted’s 100th birthday. A few weeks ago, you were selected by the family to contact all of Ted’s descendants and organize a surprise party. To make this task easier, you created an age-prioritized list of everyone descended from Ted. Descendants of the same age are listed in dictionary order.
The only materials you had to aid you were birth certificates. Oddly enough, these birth certificates were not dated. They simply listed the father’s name, the child’s name, and the father’s exact age when the baby was born.

输入

Input to this problem will begin with line containing a single integer n indicating the number of data sets. Each data set will be formatted according to the following description.
A single data set has 2 components:
Descendant Count - A line containing a single integer X (where 0 < X < 100) indicating the number of Ted’s descendants.
Birth Certificate List - Data for X birth certificates, with one certificate’s data per line. Each certificate’s data will be of the format “FNAME CNAME FAGE” where:
FNAME is the father’s name.
CNAME is the child’s name.
FAGE is the integer age of the father on the date of CNAMEs birth.
Note:
*** Names are unique identifiers of individuals and contain no embedded white space.
*** All of Ted’s descendants share Ted’s birthday. Therefore, the age difference between any two is an integer number of years. (For those of you that are really picky, assume they were all born at the exact same hour, minute, second, etc… of their birth year.)
*** You have a birth certificate for all of Ted’s descendants (a complete collection).

输出

For each data set, there will be X+1 lines of output. The first will read, “DATASET Y”, where Y is 1 for the first data set, 2 for the second, etc. The subsequent X lines constitute your age-prioritized list of Ted’s descendants along with their ages using the format “NAME AGE”. Descendants of the same age will be listed in dictionary order.
样例

input

2
1
Ted Bill 25
4
Ray James 40
James Beelzebub 17
Ray Mark 75
Ted Ray 20

output

DATASET 1
Bill 75
DATASET 2
Ray 80
James 40
Beelzebub 23
Mark 5

题目大意：

每一行数据的格式为 【父亲姓名 儿子姓名 儿子出生时父亲年龄】，已知他们都是100岁Ted的子孙后代，要求按照每个人的年龄排序，年龄相同按照姓名字典序。

题目解析：

用node结构体保存父亲姓名和出生时年龄，建立儿子姓名到此结构体的映射，这样一来，通过循环最终可遍历到根节点Ted，逐层累加年龄，用100减去这个年龄就能得到最终的年龄。再用dnode结构体记录每个人的姓名和年龄，用sort函数按要求排序即可。

具体代码：

#include<iostream>
#include<map>
#include<algorithm>
using namespace std;

struct node {//存储父子关系
int born_age;
string father;
};
struct dnode {//存储Ted子孙们个人信息
int age;
string name;
};

bool cmp(dnode x,dnode y){
if(x.age!=y.age)
return x.age>y.age;
else
return x.name<y.name;
}
int main() {
int t;
cin>>t;
for(int i=1; i<=t; i++) {
int num,k=0;
dnode arr[1100];
map<string,node> m;
cin>>num;

while(num--) {
int tmp_born_age;
string tmp_father,tmp_child;
cin>>tmp_father>>tmp_child>>tmp_born_age;
m[tmp_child].born_age=tmp_born_age;
m[tmp_child].father=tmp_father;
}
for(map<string,node>::iterator it=m.begin(); it!=m.end(); it++) {
string name=it->first;
int born_age=it->second.born_age;
string father=it->second.father;
while(father!="Ted") {
born_age+=m[father].born_age;
father=m[father].father;
}
arr[k].age=100-born_age;
arr[k].name=name;
k++;
}
sort(arr,arr+k,cmp);
cout<<"DATASET "<<i<<endl;
for(int j=0; j<k; j++) {
cout<<arr[j].name<<" "<<arr[j].age<<endl;
}
}

return 0;
}