Problems > Clinic Queue

Clinic Queue

Difficulty: 900 3000 ms 128 MB

prefix-sums

The clinic opens at minute T0 and sees patients strictly in order; patient i takes di minutes. Print the minute each patient finishes.

Input: the first line has N and T0; the second line has the N durations.

Output: N integers: the finish times.

Constraints:

  • 1 ≤ N ≤ 105
  • 1 ≤ di ≤ 120

Sample Tests

Input 1
3 480
15 30 10
Output 1
495 525 535
Input 2
1 0
60
Output 2
60

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.