Bob has just bought a record collection of $$$n$$$ records numbered from $$$1$$$ to $$$n$$$, and he can't wait to listen to them! On each of the next $$$n$$$ days, Bob will listen to some his records. He may listen to the same record multiple times, or on different days. A new record is a record that he has not listened to on previous days. Bob is very excited to start listening to his record collection, and he wants to know, what is the greatest number of new records he listens to in a single day? Help him answer this question!
The first line will contain a single integer $$$n$$$ ($$$1 \leq n \leq 1000$$$) — the number of records in Bob's collection and how many days he will listen to them.
Each of the next $$$n$$$ lines will begin with an integer $$$m$$$, followed by $$$m$$$ integers $$$r_1, \dots, r_m$$$ ($$$1 \leq m \leq 1000, 1 \leq r_i \leq n$$$) — the number of records he listened to that day and the records he listened to that day, respectively.
Output a single integer — the maximum number of new records Bob will listen to in a single day.
31 12 1 33 1 2 3
1
On the first day, Bob listens to record 1, which is new.
On the second day, Bob listens to records 1 and 3, but only record 3 is new.
On the third day, Bob listens to records 1, 2, and 3, but only record 2 is new.
Bob listens to one new record each day, so the answer is 1.
| UTPC Spring 2024 Open Contest |
|---|
| Finished |
