POJ 2021 Relative Relatives

来源：互联网发布：淘宝买家账号信誉查询编辑：程序博客网时间：2024/04/26 11:31

//============================================================================

// Name        : hello.cpp
// Author      : key
// Version     : 8
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <string>
#include <algorithm>
using namespace std;
#define NUM_INF 0XFFFFF

struct Node{
   char fa[20];
   char names[20];
   int born;
   int age;
}m[110];
int n;
int num;

bool cmp(Node &a, Node &b){
    if(a.age > b.age) return true;
    if(a.age == b.age && strcmp(a.names, b.names) < 0)
       return true;
    return false;
}

void dfs(char* str,int age)
{
   if(num>=n)
       return;
   for(int i=0;i<n;i++)
   {
       if(m[i].age!=-1)
           continue;
       if(strcmp(str,m[i].fa)==0)
       {
           num++;
           m[i].age = age - m[i].born;
           dfs(m[i].names,m[i].age);
       }
   }
}

int main()
{
   int t;
   int cases=0;
   int i;
   scanf("%d",&t);
   while(t--)
   {
       scanf("%d",&n);
       for(i=0;i<n;i++)
       {
           scanf("%s%s%d",&m[i].fa,&m[i].names,&m[i].born);
           m[i].age = -1;
       }
       num=0;
       for(i=0;i<n;i++)
       {
           if(strcmp("Ted",m[i].fa)==0)
           {
               num++;
               m[i].age = 100 - m[i].born;
               dfs(m[i].names,m[i].age);
           }
       }
       sort(m,m+n,cmp);
       printf("DATASET %d\n",cases++);
       for(i=0;i<n;i++)
           printf("%s %d\n",m[i].names,m[i].age);
   }
   return 0;
}