Skip to main content

Adding Squares Codechef October Long challenge Problem Code

 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=ai (0aiW) and M different horizontal lines, i-th of which is defined by the equation y=bi (0biH). You must add one line of the form y=k (0kHkbi for every 1iM) 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 WHNM
  • Second line will contain N different integers a1,a2,...,aN
  • Third line will contain M different integers b1,b2,...,bM

Output:

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

Constraints

  • 1W,H,N,M105
  • NW+1
  • MH
  • 0aiW for every 1iN
  • 0biH for every 1iM

Subtasks

  • 50 points : 1H,W1000
  • 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.
codechef long challenge



Solution -


Learn Bitset-
Follow the Link below for the bitset data structure and then follow my code.

C++ bitset and its application - GeeksforGeeks

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


bitset - C++ Reference - Cplusplus.com

www.cplusplus.com › Reference › <bitset>



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

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

Movie Festival CSES problem set solution

 Movie Festival CSES problem set solution - Problem statement-  Time limit:  1.00 s   Memory limit:  512 MB In a movie festival  n n  movies will be shown. You know the starting and ending time of each movie. What is the maximum number of movies you can watch entirely? Input The first input line has an integer  n n : the number of movies. After this, there are  n n  lines that describe the movies. Each line has two integers  a a  and  b b : the starting and ending times of a movie. Output Print one integer: the maximum number of movies. Constraints 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ a < b ≤ 10 9 1 ≤ a < b ≤ 10 9 Example Input: 3 3 5 4 9 5 8 Output: 2 Solution - Step -1 take input in a vector as a pair first element is ending time ans second element is starting time Step -2 sort the vector in increasing order because we will watch that movie which is ending first. Step -3 iterate over vector and calculate ans .           follow code below-