German Collegiate Programming Contest 2015

 // Legacy Code
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <string>
 #include <algorithm>
 #include <utility>
 #include <vector>
 #include <map>
 #include <queue>
 #include <stack>
 #include <cstdlib>
 #include <cmath>
 typedef long long ll;
 #define lowbit(x) (x&(-x))
 #define ls l,m,rt<<1
 #define rs m+1,r,rt<<1|1
 using namespace std;
 const int N=;
 string s;
 vector<int>v[N];
 vector<string>vs[N];
 map<int,string>mp;
 map<string,int>mp1;
 int n,k;
 bool vis[N];
 void dfs(int x)
 {
     vis[x]=;
     for(int j=;j<v[x].size();j++){
         if(!vis[v[x][j]])  dfs(v[x][j]);
     }
     return ;
 }
 int  main()
 {
     scanf("%d",&n);
     for(int i=;i<=n;i++)
     {
         cin>>s;
         mp[i]=s;
         mp1[s]=i;
         //两个map来进行整形和字符串的转换
         scanf("%d",&k);
         for(int   j=;j<k;j++)
         {
             cin>>s;
             vs[i].push_back(s);
         }
     }
     for(int  i=;i<=n;i++)
     {
         for(int  j=;j<vs[i].size();j++){
             v[mp1[vs[i][j]]].push_back(i);//vs[i][j]可以调用i
             }
     }
     memset(vis,,sizeof(vis));
     for(int i=;i<=n;i++)
     {
         if(mp[i].find("PROGRAM")==mp[i].size()-&&mp[i].size()!=&&!vis[i]){
             dfs(i);
         }
     }
     int  ans=;
     for(int i=;i<=n;i++)
     {
         if(!vis[i]) ans++;
     }
     printf("%d\n",ans);
     return  ;
 }