Troubling Times

View as PDF

Submit solution

All submissions

Best submissions

Points: 5 (partial)

Time limit: 2.0s

Memory limit: 64M

Author:

xXxP0t4t0MStRxXx

Problem type

Alex takes the entire Komputer Kids Klub onto a field trip through time and space. Being all smart and powerful, Alex leads the club into the time machine he invented. However, since Alex is also a procrastinator, he waited until the last second, finishing the time machine just minutes before the club starts, not leaving him enough time to figure out how to make the machine work efficiently.

Alex's time machine works by jumping forward and back through time in regular intervals. For example, the time machine can be configured to jump in intervals of 4 days, which means the time machine is able to travel forward 4 days with at least 1 jump, travel forward 8 days with at least 2 jumps, or travel backward 16 days with at least 4 jumps.

Obviously tired from the hard work put into making the time machine, Alex asks you to help him determine the optimal interval to use to get to the destination time.

His time machine has $N$ $N$ different interval options that can be used, and he wishes to take the club to $D$ $D$ days into the future, whereas negative $D$ $D$ signifies travelling to the past. He wants you to tell him what is the lowest number of jumps the machine has to perform to reach $D$ $D$ . Be aware, once an interval is chosen, it cannot be changed. Also, there might be times when $D$ $D$ cannot be reached with the available intervals, in that case, output This is not the best time for a trip..

Input Specification

The first line of the input will contain two integers $N$ $N$ $(1 \le N \le 10^4)$ $(1 \leq N \leq 10^{4})$ , representing the number of different interval options, and $D$ $D$ $(-10^4 \le D \le 10^4)$ $(- 10^{4} \leq D \leq 10^{4})$ , the destination time.

The next line will contain $N$ $N$ integers denoting the length of each interval option.

Output Specification

Output an integer $J$ $J$ , the minimum number of jumps the machine has to perform to reach $D$ $D$ , or This is not the best time for a trip. if the destination is unreachable.

Sample Input 1

Copy

5 -10
1 2 3 4 5

Sample Output 1

Copy

Explanation 1

With the interval $5$ $5$ , $-10$ $- 10$ can be reached with $2$ $2$ jumps.

Sample Input 2

Copy

2 10
3 7

Sample Output 2

Copy

This is not the best time for a trip.

Explanation 2

$10$ $10$ cannot be visited no matter whether you choose $3$ $3$ or $7$ $7$ as the interval.

Comments

3

julian33 commented on July 9, 2020, 5:26 p.m.

I tried doing this in Python and got ValueError, and then I did the exact same code in C++ and got AC on everything. I have no clue what's going on.

3

Yungblud77 commented on Nov. 6, 2019, 3:24 a.m.

Its 10:30 and I'm tired why am I getting WA on only one test case >:(

40

echofox commented on Sept. 25, 2017, 1:22 p.m.

komputer kids klubs 🤔

-14

loltrollkill commented on Nov. 7, 2018, 12:02 a.m.

kool kids klub

This comment is hidden due to too much negative feedback. Show it anyway.

-12

Robloxian commented on Nov. 9, 2018, 7:27 p.m.

funny

This comment is hidden due to too much negative feedback. Show it anyway.