Relative Relatives
Description
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
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:
Note:
Output
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.
Sample Input 2 1 Ted Bill 25 4 Ray James 40 James Beelzebub 17 Ray Mark 75 Ted Ray 20 Sample Output DATASET 1 Bill 75 DATASET 2 Ray 80 James 40 Beelzebub 23 Mark 5 Source |
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int Max = 105;
typedef struct data{
int age;
char name[20];
}data;
data node[Max];
bool cmp(data a, data b){
if(a.age > b.age) return true;
if(a.age == b.age && strcmp(a.name, b.name) < 0) return true; // 字典序排序。
return false;
}
int main()
{
char fa[Max][20], ch[Max][20];
int textCase, t, n, k, i, j, year[Max];
cin >> textCase;
node[0].age = 100;
strcpy(node[0].name, "Ted");
for(t = 1; t <= textCase; t ++)
{
cin >> n;
for(i = 1; i <= n; i ++)
cin >> fa[i] >> ch[i] >> year[i];
for(i = 0, k = 1; i < n; i ++)
for(j = 1; j <= n; j ++)
if(strcmp(node[i].name, fa[j]) == 0)
{
node[k].age = node[i].age - year[j];
strcpy(node[k].name, ch[j]);
k ++;
}
sort(node, node+n+1, cmp);
cout << "DATASET " << t << endl;
for(i = 1; i <= n; i ++)
cout << node[i].name << ' ' << node[i].age << endl;
}
return 0;
}