VK Cup 2015 - Qualification Round 1 A. Reposts(map最大连续长度)

最新推荐文章于 2021-12-28 00:41:14 发布

一种坚持__

最新推荐文章于 2021-12-28 00:41:14 发布

阅读量2.3w

点赞数

分类专栏： Codeforces

本文链接：https://blog.csdn.net/u014361775/article/details/44655183

版权

Codeforces 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

One day Polycarp published a funny picture in a social network making a poll about the color of his handle. Many of his friends started reposting Polycarp's joke to their news feed. Some of them reposted the reposts and so on.

These events are given as a sequence of strings "name1 reposted name2", where name1 is the name of the person who reposted the joke, and name2 is the name of the person from whose news feed the joke was reposted. It is guaranteed that for each string "name1reposted name2" user "name1" didn't have the joke in his feed yet, and "name2" already had it in his feed by the moment of repost. Polycarp was registered as "Polycarp" and initially the joke was only in his feed.

Polycarp measures the popularity of the joke as the length of the largest repost chain. Print the popularity of Polycarp's joke.

Input

The first line of the input contains integer n (1 ≤ n ≤ 200) — the number of reposts. Next follow the reposts in the order they were made. Each of them is written on a single line and looks as "name1 reposted name2". All the names in the input consist of lowercase or uppercase English letters and/or digits and have lengths from 2 to 24 characters, inclusive.

We know that the user names are case-insensitive, that is, two names that only differ in the letter case correspond to the same social network user.

Output

Print a single integer — the maximum length of a repost chain.

   Sample test(s) 
 

     input 
   
5
tourist reposted Polycarp
Petr reposted Tourist
WJMZBMR reposted Petr
sdya reposted wjmzbmr
vepifanov reposted sdya

     output 
   
6

     input 
   
6
Mike reposted Polycarp
Max reposted Polycarp
EveryOne reposted Polycarp
111 reposted Polycarp
VkCup reposted Polycarp
Codeforces reposted Polycarp

     output 
   
2

     input 
   
1
SoMeStRaNgEgUe reposted PoLyCaRp

     output 
   
 2
 给出3个字符串a,b,c a转帖于c 问从 Polycarp 出发，到转帖的最后一个人的最大长度，一开始用map的时候，是以被转帖人的名字为下标的，结果输入的时候只保存了最后一个Polycarp转帖人名字，果断WA了，其实以每个转帖人的名字为下标，来记录当前长度即可
 所有名字不区分大小写
 
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#define inf 0x3f3f3f3f
#define N 30
using namespace std;
char a[N],b[N],c[N];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        map<string,int>q;
        q["POLYCARP"]=1;
        int ans=0;
        for(int i=0; i<n; i++)
        {
            scanf("%s%s%s",a,b,c);
            int len1=strlen(a);
            for(int j=0; j<len1; j++)
            {
                if(a[j]>='a' && a[j]<='z')
                    a[j]-=32;
            }
            int len2=strlen(c);
            for(int j=0; j<len2; j++)
            {
                if(c[j]>='a' && c[j]<='z')
                    c[j]-=32;
            }
            q[a]=q[c]+1;
            ans=max(ans,q[a]);
    }
    printf("%d\n",ans);
}
return 0;
}