## Adding Squares  Codechef October Long challenge Problem Code-

### problem Statement-

There are $N$ different vertical lines on the plane, $i$-th of which is defined by the equation $x={a}_{i}$ ($0\le {a}_{i}\le W$) and $M$ different horizontal lines, $i$-th of which is defined by the equation $y={b}_{i}$ ($0\le {b}_{i}\le H$). You must add one line of the form $y=k$ ($0\le k\le H$$k\ne {b}_{i}$ for every $1\le i\le M$) to the plane. What is the maximum possible number of squares with different areas you can obtain on the plane? (Squares can have other lines passing through them)

### Input:

• First line will contain $4$ integers $W$$H$$N$$M$
• Second line will contain $N$ different integers ${a}_{1},{a}_{2},...,{a}_{N}$
• Third line will contain $M$ different integers ${b}_{1},{b}_{2},...,{b}_{M}$

### Output:

Output the maximal possible number of squares with different area on the plane after adding a new line.

### Constraints

• $1\le W,H,N,M\le {10}^{5}$
• $N\le W+1$
• $M\le H$
• $0\le {a}_{i}\le W$ for every $1\le i\le N$
• $0\le {b}_{i}\le H$ for every $1\le i\le M$

• 50 points : $1\le H,W\le 1000$
• 50 points : Original constraints

### Sample Input:

10 10 3 3
3 6 8
1 6 10


### Sample Output:

3


### Explanation:

You can get $3$ different squares if you add a line $y=4$. The three squares are:

• Square with top-left corner at (6, 6) and bottom-right corner at (8, 4) with an area of 4.
• Square with top-left corner at (3, 4) and bottom-right corner at (6, 1) with an area of 9.
• Square with top-left corner at (3, 6) and bottom-right corner at (8, 1) with an area of 25.

Learn Bitset-

### C++ bitset and its application - GeeksforGeeks

www.geeksforgeeks.org › c-bitset-and-its-application

### bitset - C++ Reference - Cplusplus.com

www.cplusplus.com › Reference › <bitset>

### Vaccine Distribution Codechef December Long challenge solution 2020

Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

### Codechef February long challenge solution 2021

Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

### 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