-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFACEFRND.cpp
63 lines (55 loc) · 1.2 KB
/
FACEFRND.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
63
#include<bits/stdc++.h>
using namespace std;
#define vi vector<long long int>
#define set1 set<long long int>
#define pb push_back
#define pob pop_back
#define map1 map<long long int,long long int>
#define ll long long int
#define mp make_pair
#define inf 1e17
#define minf INT_MIN
#define setbits(x) __builtin_popcountll(x)
#define pres(x,y) fixed<<setprecision(y)<<x
#define pair1 pair<long long int,long long int>
#define mk(arr,n,type) type *arr=new type[n];
#define mod 1000000007
#define pi 3.1415926535897932384626433832
#define ins insert
#define what_is(x) cerr << #x << " is " << x << endl;
#define w(t) long long int t;t=1;while(t--)
void solve() {
ll n;
cin >> n;
set1 s, d;
while (n--) {
ll id;
cin >> id;
d.ins(id);
ll no;
cin >> no;
for (ll i = 0; i < no; i++) {
ll x;
cin >> x;
s.ins(x);
}
}
for (auto x : d) {
if (s.find(x) != s.end()) {
s.erase(x);
}
}
cout << s.size() << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
w(t) {
solve();
}
return 0;
}