Skip to main content

Frog Sort codechef February 2021 long challenge editorial


 Frog Sort codechef February 2021  long challenge editorial -

There are N frogs (numbered 1 through N) in a line. For each valid i, the i-th frog is initially at the position i, it has weight Wi, and whenever you hit its back, it jumps a distance Li to the right, i.e. its position increases by Li. The weights of the frogs are pairwise distinct.

You can hit the back of each frog any number of times (possibly zero, not necessarily the same for all frogs) in any order. The frogs do not intefere with each other, so there can be any number of frogs at the same time at each position.

Your task is to sort the frogs in the increasing order of weight using the smallest possible number of hits. In other words, after all the hits are performed, then for each pair of frogs (i,j) such that Wi<Wj, the position of the i-th frog should be strictly smaller than the position of the j-th frog. Find the smallest number of hits needed to achieve such a state.


  • The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
  • The first line of each test case contains a single integer N.
  • The second line contains N space-separated integers W1,W2,,WN.
  • The third line contains N space-separated integers L1,L2,,LN.


For each test case, print a single line containing one integer ― the smallest number of times you need to hit the backs of the frogs.


  • 1T2104
  • 2N4
  • 1WiN for each valid i
  • 1Li5 for each valid i
  • no two frogs have the same weight


Subtask #1 (50 points):

  • T=50
  • N=2

Subtask #2 (50 points): original constraints

Example Input

3 1 2
1 4 5
3 2 1
1 1 1
2 1 4 3
4 1 2 4

Example Output



Example case 1: We can hit the back of the first frog three times.

Example case 2: We can hit the back of the first frog four times, then hit the back of the second frog two times.

Problem Statement- 


Hint - fix the minimum weight element and arrange the rest of elements.

Solution will be posted anytime soon stay connect .

Must join Telegram channel -


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

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

Concert Tickets Cses Problem set solution | Concert Tickets Cses Problem set solution Using multiset

 Concert Tickets Cses Problem set solution- Porblem statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  concert tickets available, each with a certain price. Then,  m m  customers arrive, one after another. Each customer announces the maximum price he or she is willing to pay for a ticket, and after this, they will get a ticket with the nearest possible price such that it does not exceed the maximum price. Input The first input line contains integers  n n  and  m m : the number of tickets and the number of customers. The next line contains  n n  integers  h 1 , h 2 , … , h n h 1 , h 2 , … , h n : the price of each ticket. The last line contains  m m  integers  t 1 , t 2 , … , t m t 1 , t 2 , … , t m : the maximum price for each customer. Output Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again. If a customer cannot get any ticket, print  − 1 − 1 . Constraints 1 ≤ n , m ≤ 2 ⋅ 10 5 1 ≤ n , m ≤ 2 ⋅