307412: CF1354A. Alarm Clock
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Alarm Clock
题意翻译
小$P$每天要睡足$a$分钟。他定了一个闹钟,会在$b$分钟后响起。如果此时小$P$还没有睡足$a$分钟,那么他会定一个$c$分钟的闹钟,并花费$d$分钟入睡。如果他被吵醒后仍未达到$a$分钟,那么他会再定$c$分钟闹钟并花费$d$分钟入睡……如果某次闹钟响起时他已经睡足了$a$分钟,他就会起床。 请问他一共要花费多少分钟才会起床,或者他永远不会起床。题目描述
Polycarp has spent the entire day preparing problems for you. Now he has to sleep for at least $ a $ minutes to feel refreshed. Polycarp can only wake up by hearing the sound of his alarm. So he has just fallen asleep and his first alarm goes off in $ b $ minutes. Every time Polycarp wakes up, he decides if he wants to sleep for some more time or not. If he's slept for less than $ a $ minutes in total, then he sets his alarm to go off in $ c $ minutes after it is reset and spends $ d $ minutes to fall asleep again. Otherwise, he gets out of his bed and proceeds with the day. If the alarm goes off while Polycarp is falling asleep, then he resets his alarm to go off in another $ c $ minutes and tries to fall asleep for $ d $ minutes again. You just want to find out when will Polycarp get out of his bed or report that it will never happen. Please check out the notes for some explanations of the example.输入输出格式
输入格式
The first line contains one integer $ t $ ( $ 1 \le t \le 1000 $ ) — the number of testcases. The only line of each testcase contains four integers $ a, b, c, d $ ( $ 1 \le a, b, c, d \le 10^9 $ ) — the time Polycarp has to sleep for to feel refreshed, the time before the first alarm goes off, the time before every succeeding alarm goes off and the time Polycarp spends to fall asleep.
输出格式
For each test case print one integer. If Polycarp never gets out of his bed then print -1. Otherwise, print the time it takes for Polycarp to get out of his bed.
输入输出样例
输入样例 #1
7
10 3 6 4
11 3 6 4
5 9 4 10
6 5 2 3
1 1 1 1
3947465 47342 338129 123123
234123843 13 361451236 361451000
输出样例 #1
27
27
9
-1
1
6471793
358578060125049