P19295 [CodeChef] MEET
普及
题目描述

Read problem statements in [Hindi], [Bengali], [Mandarin Chinese], [Russian], and [Vietnamese] as well.

A time is a string in the format "HH:MM AM" or "HH:MM PM" (without quotes), where HH and MM are always two-digit numbers. A day starts at 12:00 AM and ends at 11:59 PM. You may refer [here] for understanding the 12-hour clock format.

Chef has scheduled a meeting with his friends at a time $P$. He has $N$ friends (numbered $1$ through $N$); for each valid $i$, the $i$-th friend is available from a time $L_{i}$ to a time $R_{i}$ (both inclusive). For each friend, can you help Chef find out if this friend will be able to attend the meeting? More formally, check if $L_{i} ≤ P ≤ R_{i}$ for each valid $i$.

------ Input ------
The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
The first line of each test case contains a single time $P$.
The second line contains a single integer $N$.
$N$ lines follow. For each valid $i$, the $i$-th of these lines contains two space-separated times $L_{i}$ and $R_{i}$.

------ Output ------
For each test case, print a single line containing one string with length $N$. For each valid $i$, the $i$-th character of this string should be '1' if $i$-th friend will be able to attend the meeting or '0' otherwise.

------ Constraints ------
$1 ≤ T ≤ 500$
$1 ≤ N ≤ 500$
each time is valid in the 12-hour clock format
for each valid $i$, the time $R_{i}$ is greater or equal to $L_{i}$

------ Subtasks ------
Subtask #1 (100 points): original constraints

----- Sample Input 1 ------
2

12:01 AM

4

12:00 AM 11:42 PM

12:01 AM 11:59 AM

12:30 AM 12:00 PM

11:59 AM 11:59 PM

04:12 PM

5

12:00 AM 11:59 PM

01:00 PM 04:12 PM

04:12 PM 04:12 PM

04:12 AM 04:12 AM

12:00 PM 11:59 PM
----- Sample Output 1 ------
1100

11101
----- explanation 1 ------
Example case 1:
- Friend $1$: 12:01 AM lies between 12:00 AM and 11:42 PM (that is, between 00:00 and 23:42 in the 24-hour clock format), so this friend will be able to attend the meeting.
- Friend $2$: 12:01 AM lies between 12:01 AM and 11:59 AM (between 00:01 and 11:59 in the 24-hour clock format).
- Friend $3$: 12:01 AM does not lie between 12:30 AM and 12:30 PM (between 00:30 and 12:30 in the 24-hour clock format), so this friend will not be able to attend the meeting.
- Friend $4$: 12:01 AM does not lie between 11:59 AM and 11:59 PM (between 11:59 and 23:59 in the 24-hour clock format).

Example case 2: For friend $3$, 04:12 PM lies between 04:12 PM and 04:12 PM (inclusive) and hence this friend will be able to attend the meeting.

输入格式

见题面

输出格式

见题面

样例输入
2 12:01 AM 4 12:00 AM 11:42 PM 12:01 AM 11:59 AM 12:30 AM 12:00 PM 11:59 AM 11:59 PM 04:12 PM 5 12:00 AM 11:59 PM 01:00 PM 04:12 PM 04:12 PM 04:12 PM 04:12 AM 04:12 AM 12:00 PM 11:59 PM
样例输出
1100 11101