Can someone please help me in understanding below problem -
Distributing Medals It's the medal distribution ceremony. 10^6 police officers, numbered from 1 to 10^6, are standing in a line. There are N (1<=N<=1000) iterations of medal distribution. In iteration i (0 < = i < N), count[i] ( 1 < = count[i] < = 100) medals are given to all officers from from[i] to to[i] ( 1 < = from[i] < = to[i] < = 10^6 )
If we sum up the number of medals received starting from the first officer, who would be the first officer for which the cumulative sum exceeds a given medal count THRESHOLD ( 1 < = THRESHOLD < = 10^9 )?
Input/Output Specifications Input format:
You are given 5 inputs:
input1 = N, the number of iterations
input2 = count, the array of medal counts in each iteration
input3 = from, the array of starting indices in each iteration
input4 = to, the array of ending indices in each iteration
input5 = THRESHOLD, the medal count threshold
An integer, representing the number of the first officer such that the cumulative sum of medals starting from the first officer upto this officer exceeds THRESHOLD. The output should be -1 if such an officer does not exist.
This question was asked in one interview, but i am not able to understand this problem.
posted 5 years ago
Also i wanted to know if any real world scenario/use-case/example related to this?
think of the situation where you have 10 policemen, 3 iterations, and
in interation 1 four medals are given, starting at policeman 2,
in the second iteration 3 are given, starting at pm 6, and so on.
You know how many medals are given in each iteration (why?),
so how would you do the counting, taking care of the given
I hate signatures!
Have you no shame? Have you no decency? Have you no tiny ad?