RRSCHED - Round-Robin Scheduling
A computer processor is given N tasks to perform (1 ≤ N ≤ 50,000). The i-th task requires Ti seconds of processing time (1 ≤ Ti ≤ 1,000,000,000). The processor runs the tasks as follows: each task is run in order, from 1 to N, for 1 second, and then the processor repeats this again starting from task 1. Once a task has been completed, it will not be run in later iterations. Determine, for each task, the total running time elapsed once the task has been completed.
The first line of the input contains the integer N, and the next N lines contain the integers T1 through TN.
Output N lines, the i-th of which contains an integer representing the time elapsed when task i has been processed.
Input: 5 8 1 3 3 8 Output: 22 2 11 12 23
The second task is completed during the first iteration, finishing 2 seconds in. On the third iteration, the third and fourth tasks complete at 11 seconds and 12 seconds, respectively. Finally, on the eighth iteration, the first and last tasks complete at 22 seconds and 23 seconds, respectively.
Note: This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2006, TopCoder, Inc. All rights reserved.
(See this post for more information.)
Not using long long int cost me 1WA. Classic BIT;
use long long int for answer, it cost me 3 WALast edit: 2016-02-16 16:32:05
in one go ! :D
one way i know is
There is only 1 test case.
tried all cases.. so damn frustrating to get WA..