Page Contents

*Chef and Easy Queries Solution*

*Chef and Easy Queries Solution*

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 k). 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 *

- 1≤T≤105
- 1≤ sum of n over all testcases ≤105
- 1≤k≤108
- 0≤Qi≤108

*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.

*Solution*

*Solution*

*Program C++:*

#include<bits/stdc++.h> using namespace std; typedef long long int lli; typedef unsigned long long int ulli; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); lli t; cin>>t; while(t--){ lli n,k; cin>>n>>k; lli x,flag=0; lli sum=0,s2=0; for(lli i=0;i<n;++i){ cin>>x; sum+=x; s2+=x; sum-=k; if(sum<0 && flag==0){ cout<<i+1<<'\n'; flag=1; } } if(flag!=1)cout<<(s2/k)+1<<'\n'; } return 0; }

*Program Python: *

# cook your dish here t=int(input()) for I in range(t): n,k=map(int,input().split()) a=list(map(int,input().split())) s=0 c=0 p=1 for j in range(n): if(a[j]+s-k>=0): s=a[j]+s-k else: p=0 print(j+1) break if(p==1): print(sum(a)//k+1)

*Program Java:*

import java.util.*; import java.lang.*; import java.io.*; class Codechef { public static void main (String[] args) throws java.lang.Exception { Scanner sc =new Scanner(System.in); int t = sc.nextInt(); long[] ar; while (t-- > 0){ int n = sc.nextInt(); long k = sc.nextLong(); ar = new long[n]; long sum = 0; for (int i = 0; i < n; i++) { ar[i] = sc.nextLong(); } long count = 0; long leftover=0; long ans = 0; for (int i = 0; i < n; i++) { count=ar[i]+leftover; leftover=count-k; if(count < k){ ans = i+1; System.out.println(ans); break; } } if(leftover >= 0){ long a = leftover/k; ans = n+a+1; System.out.println(ans); } } } }

*November Long Challenge 2020 *

*November Long Challenge 2020*

*Ada and Dishes SOLUTION ADADISH**Iron Magnet and Wall SOLUTION FEMA2**Magical Candy Store SOLUTION CNDYGAME**Unusual Queries SOLUTION UNSQUERS**Red-Black Boolean Expression SOLUTION RB2CNF**Chef and the Combination Lock SOLUTION CHEFSSM**Scalar Product Tree SOLUTION SCALSUM**Connect on a Grid (Challenge) SOLUTION CONGRID**Selecting Edges SOLUTION SELEDGE**Panic! at the Disco SOLUTION PANIC**Restore Sequence SOLUTION RESTORE*