Skip to main content

Chef and Easy Queries codechef October long challenge problem solution editorial

Chef and Easy Queries CodeChef October long challenge problem solution -

This problem (Chef and Easy Queries) is taken from CodeChef October long challenge.

Problem Statement-

Chef published a blog post, and is now receiving many queries about it. On day i, he receives Qi queries. But Chef can answer at most k queries in a single day.

Chef always answers the maximum number of questions that he can on any given day (note however that this cannot be more than ). The remaining questions (if any) will be carried over to the next day.

Fortunately, after n days, the queries have stopped. Chef would like to know the first day during which he has some free time, i.e. the first day when he answered less than k questions.

Input:

  • First line will contain T, the number of testcases. Then the testcases follow.
  • The first line of each testcase contains two space separated integers n and k.
  • The second line of each testcase contains n space separated integers, namely Q1,Q2,...Qn.

Output:

For each testcase, output in a single line the first day during which chef answers less than k questions.

Constraints

  • 1T105
  • 1 sum of n over all testcases 105
  • 1k108
  • 0Qi108

Subtasks

  • Subtask 1 - 20% points - Sum of Qi over all testcases and days 3.106
  • Subtask 2 - 80% points - Original constraints

Sample Input:

2 
6 5 
10 5 5 3 2 1 
1 1
100

Sample Output:

6
101

Explanation:

Test Case 1

On the first day, chef answers 5 questions and leaves the remaining 5 (out of the 10) for the future days.

On the second day, chef has 10 questions waiting to be answered (5 received on the second day and 5 unanswered questions from day 1). Chef answers 5 of these questions and leaves the remaining 5 for the future.

On the third day, chef has 10 questions waiting to be answered (5 received on the third day and 5 unanswered questions from earlier). Chef answers 5 of these questions and leaves the remaining 5 for later.

On the fourth day, chef has 8 questions waiting to be answered (3 received on the fourth day and 5 unanswered questions from earlier). Chef answers 5 of these questions and leaves the remaining 3 for later.

On the fifth day, chef has 5 questions waiting to be answered (2 received on the fifth day and 3 unanswered questions from earlier). Chef answers all 5 of these questions.

On the sixth day, chef has 1 question, which he answers. This is the first day he answers less than 5 questions, and so the answer is 6.

Test Case 2

Chef answers 1 question a day for the first 100 days. On day 101, he is free

codechef October long challenge problem solutio






Chef and easy queries is also a simple problem from october long challenge so i will explain this problem into very simple language.This problem can be done by using brute froce approach.


Logic -

Logic of this problem divided into 5 step they are mentioned below.


step-1 take t,n and k;

step -2 maintain sum variable, prev variable and day variable. sum stores sum of all quaries and prev store sum of remaining queries and 

day store very first day when chef has free time.They sould be long long int otherwise your program show wrong answer do care about long long int.

step -3 maintain a check flag which tells does chef have free time or not in very first-day chef has free time and so mark flag as true 

initially.

step-4 while iterating trough i=0 to n take input 

long long  int d;

        cin>>d;

and add d into sum variable and add d to remaining queries which is stored in prev variable.


sum+=d;

 prev+=d;

and check is previous is less then k if yes mark check as false  so that we can not enter 

in the if statement again because here we 

got very first day when chef has free time.


if(prev<k&&check){

            day=i+1;

            check=false;

            

        }


step -5 if it is not so subtract k queries from previous queries because he will solve k queries on ith day.

reapeat all step till we reach the answer.


after iterating frolm i=0 to n we can decide wether chef can have free time or not 

if our check is marked as false it mean chef got free time before all nth day  

so i will print day 

other wise devide total sum by k because chef will solve average k questies per day and print (sum/k +1)th day.


Code for Problem mentioned below-






Comments

Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi