GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

Monday 1 August 2022

[Solution] Everyone Loves to Sleep Codeforces Solution



A. Everyone Loves to Sleep
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Vlad, like everyone else, loves to sleep very much.

Every day Vlad has to do n things, each at a certain time. For each of these things, he has an alarm clock set, the i-th of them is triggered on hi hours mi minutes every day (0hi<24,0mi<60). Vlad uses the 24-hour time format, so after h=12,m=59 comes h=13,m=0 and after h=23,m=59 comes h=0,m=0.

This time Vlad went to bed at H hours M minutes (0H<24,0M<60) and asks you to answer: how much he will be able to sleep until the next alarm clock.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

 occupied

If any alarm clock rings at the time when he went to bed, then he will sleep for a period of time of length 0.

Input

The first line of input data contains an integer t (1t100) — the number of test cases in the test.

The first line of the case contains three integers nH and M (1n10,0H<24,0M<60) — the number of alarms and the time Vlad went to bed.

The following n lines contain two numbers each hi and mi (0hi<24,0mi<60) — the time of the i alarm. It is acceptable that two or more alarms will trigger at the same time.

Numbers describing time do not contain leading zeros.

Output

Output t lines, each containing the answer to the corresponding test case. As an answer, output two numbers  — the number of hours and minutes that Vlad will sleep, respectively. If any alarm clock rings at the time when he went to bed, the answer will be 0 0.

No comments:

Post a Comment