Description

Input

Output

Sample Input

22lcpc 3 7 4 fegla compo fouad nicolescpc 5 11 3 fegla fouad nicole2jcpc 8 10 2 fegla hossamscpc 10 15 3 fegla fouad nicole

3feglafouadnicole1fegla

 1 #include<iostream>
 2 #include<stdio.h>
 3 #include<vector>
 4 #include<map>
 5 #include<algorithm>
 6 #include<set>
 7 #include<string>
 8 #include<string.h>
 9 using namespace std;
10 map<string,int>mp;
11 vector<pair<int,int> >v[11000];
12 vector<string>ans;
13 string s[11000];
14 int cmp1(string s,string t){return s<t;}
15 int cmp(pair<int,int>a,pair<int,int>b)
16 {
17     if(a.first==b.first)
18         return a.second<b.second;
19     return a.first<b.first;
20 }
21 int main()
22 {
23     int t;
24     scanf("%d",&t);
25     while(t--)
26     {
27         mp.clear();
28         ans.clear();
29         int n,st,en,vol;
30         int cnt=0;
31         string na;
32         scanf("%d",&n);
33         for(int i=0;i<n;i++)
34         {
35             cin>>na>>st>>en>>vol;
36             for(int j=0;j<vol;j++)
37             {
38                  cin>>na;
39                  if(mp[na])
40                     v[mp[na]].push_back(make_pair(st,en));
41                  else
42                  {
43                      mp[na]=++cnt;
44                      s[cnt]=na;
45                      v[cnt].clear();
46                      v[cnt].push_back(make_pair(st,en));
47                  }
48             }
49         }
50         //cout<<cnt<<endl;
51         for(int i=1;i<=cnt;i++)
52         {
53             //cout<<v[i].size()<<endl;
54             if(v[i].size()==1)
55                 continue;
56             sort(v[i].begin(),v[i].end(),cmp);
57             for(int j=0;j<v[i].size()-1;j++)
58             {
59                 if(v[i][j].second>=v[i][j+1].first)
60                 {
61                     ans.push_back(s[i]);
62                     break;
63                 }
64             }
65         }
66         sort(ans.begin(),ans.end(),cmp1);
67         printf("%d\n",ans.size());
68         for(int i=0;i<ans.size();i++)
69             cout<<ans[i]<<endl;
70     }
71     return 0;
72 }