-
Notifications
You must be signed in to change notification settings - Fork 0
/
1072.cpp
62 lines (62 loc) · 1.33 KB
/
1072.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 300005
#define lb(x) (x&(-x))
const double eps = 1e-6;
using namespace std;
inline ll read()
{
char ch = getchar(); ll s = 0, w = 1;
while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
return s * w;
}
inline void write(ll x)
{
if (x < 0)putchar('-'), x = -x;
if (x > 9)write(x / 10);
putchar(x % 10 + 48);
}
set<ll>t;
int main()
{
ll n,m;
cin>>n>>m;
for(rg i=1;i<=m;i++)
{
ll x=read();
t.insert(x);
}
ll sum=0,tot=0;
for(rg i=1;i<=n;i++)
{
string s;
cin>>s;
ll k=read(),cnt=0;
vector<ll>ans;
for(rg j=1;j<=k;j++)
{
ll x=read();
if(t.find(x)!=t.end())ans.push_back(x);
}
if(ans.size())
{
cout<<s<<": ";
tot++;
for(auto it:ans)
{
cnt++;
sum++;
cnt==ans.size()?cout<<setw(4)<<setfill('0')<<it<<endl:cout<<setw(4)<<setfill('0')<<it<<" ";
}
}
}
cout<<tot<<" "<<sum<<endl;
return 0;
}