34395번 - Office Hours 2 다국어

문제

It's the start of a very busy semester, and your professor wants to determine when to schedule office hours so that they can be attended by as many students as possible. They have schedules for every student, but there are a lot of students! Can you write an algorithm to determine which two hours in the week will maximize the number of students who can attend at least one office hour?

입력

The first line is an integer 2ドル \leq N \leq 10,000円,ドル the number of lines that specify the student schedules.

The following $N$ lines specify the availability of a single student on a single day. Each line contains a series of space-separated fields. The first field consists of between 1ドル$ and 10ドル$ alphabetical characters, specifying the student's name. The second field is the day of the week for which the student is reporting availability (e.g. "Monday"), including weekends. The third field is an integer 1ドル \leq P \leq 24,ドル the number of unique, non-overlapping time ranges for which the student has reported availability. The final $P$ fields on the line are time ranges, in the format x-y, where $x < y$ and $x$ and $y$ are both integers between 0ドル$ and 24ドル,ドル inclusive, specifying the hour that marks the beginning and end of their availability, respectively.

Note that the combination of student name and day is unique. That is, a student will not report their availability for the same day on multiple lines.

Note also that the input will be such that there is a unique combination of two hours for which the maximum number of students are available.

출력

Two lines specifying the two days and times that maximize the number of students that can attend at least one office hour. The first line should represent a time occurring earlier in the week than the second line, assuming that Sunday at hour 0ドル$ represents the beginning of the week.

제한

노트