You are not logged in. Please login at www.codechef.com to post your questions!

×

# PROBLEM LINK:

Author: Hasan Jaddouh
Tester: Misha Chorniy
Editorialist: Pushkar Mishra

Simple

Greedy

# PROBLEM:

Given an array of $A$ of $N$ integers which represent stick lengths, we have to report the maximal area over all the rectangles that we can form with the given sticks without breaking any.

# EXPLANATION:

The problem is a simple one based on a very basic property of all rectangles: the opposite sides of a rectangle are parallel, and hence, equal in length. The area of a rectangle is given by base $B$ multiplied by height $H$. Now, to maximise the area, we simply need to maximise the length of sticks we choose as our $B$ and $H$. This is pretty intuitive but we can also invoke the exchange argument method (page 3 of link) to give a more formal argument as proof of why this works (left to reader as a simple learning exercise).

Now we come to the implementation detail of the above mentioned algorithm. Note that $N$ and $A_{max}$ both range between 1 and $10^3$. So, one way is that we simply keep an array $Count$ of length $10^3$ wherein $Count[i]$ is the number of sticks of length $i$ that we have. Once we have populated this structure, we can simply scan from $10^3$ down to 1. If while scanning, we can find one field which has more than 3 sticks, then that $i$ can be our height and base both; at this point we terminate our scan. If we find a field that has more than 1 stick, we can make it either our height or base and continue our scan to find a value for the other one. If at the end of scan we don't find at least two $i$ for which the count is more than 1, then we output -1 since no rectangle can be formed.

The other implementation can be by using a map instead of an array. In that case, if the $N$ is much smaller than $A_{max}$, we can get a better performance. Both of the implementations easily pass for the given constraints.

Please see editorialist's/setter's program for implementation details.

# COMPLEXITY:

$\mathcal{O}(N\log N)$ or $\mathcal{O}(A_{max})$ per test case.

# SAMPLE SOLUTIONS:

This question is marked "community wiki".

asked 25 Jun '16, 12:31

1.3k156381
accept rate: 4%

0★admin ♦♦
19.0k348495533

37 Answers:
 2 @code_blooded_ I did same in C++. https://www.codechef.com/viewsolution/10622129 answered 27 Jun '16, 10:08 2★easy_ 128●6 accept rate: 0%
 0 whats wrong with my implementation ? link- https://www.codechef.com/viewsolution/10624567 answered 27 Jun '16, 00:15 21●3 accept rate: 0% Try this test: 1 4 1 2 3 3 Your solution output 0, but must be -1 BTW, change for(i=0;i<10002;i++) to for(i=0;i<10001;i++), your arrays size only 10001 (27 Jun '16, 01:33) mgch6★
 0 I implemented in c++ and java. In c++ I am getting run-time error when I am running the code in the code-compile-run here. And in Java it's wrong answer. Java Implementation: http://pastebin.com/gAFVG2Fs C++ Implementation: http://pastebin.com/nf4zuNSM If possible please tell me what is wrong with these two codes. answered 27 Jun '16, 00:28 1 accept rate: 0% You forget about square: 1 4 1 1 1 1 Your solution output -1, but must be 1. (27 Jun '16, 01:35) mgch6★
 0 A different implementation of the above logic. https://www.codechef.com/viewsolution/10616757 First enter all the length of the sticks in an array, sort it in O(nlogn) and then traverse the array from the right end, checking for multiple instances of any stick. This also covers the special case of a square. answered 27 Jun '16, 00:32 774●9 accept rate: 11%
 0 hey,can anyone just help me to find error in my code.. https://www.codechef.com/viewsolution/10623972 answered 27 Jun '16, 00:58 3★nanhe 41●3 accept rate: 0% You forget about square case too (27 Jun '16, 01:37) mgch6★ can u elaborate more ,which case i have omitted (27 Jun '16, 01:53) nanhe3★ 1 4 1 1 1 1 (27 Jun '16, 01:57) mgch6★ ok,I got it ..thank U (27 Jun '16, 02:00) nanhe3★
 0 A different approach,which has O(N*logN) time complexity but uses Only One Array is as follows: After storing the array containing the lengths of sticks, sort it. We must note that the same lengths will automatically come together after sorting. For example, the array 5 2 8 3 1 2 4 3 5 becomes 1 2 2 3 3 4 5 5 8 Then if we traverse the array from backwards picking up the first two occurrences of a pair of same numbers(for e.g (5,5) would be the first occurrence and (3,3) would be the second in this case.Don't forget to break the loop here. :P ) the answer would be 5*3=15.If we are unable to find two occurrences we print -1. The JAVA solution of the problem using this method is: https://www.codechef.com/viewsolution/10620032. answered 27 Jun '16, 02:50 21●1 accept rate: 0%
 0 https://www.codechef.com/viewsolution/10618548 Please let me know what is wrong with this solution. answered 27 Jun '16, 10:46 1 accept rate: 0%
 0 @sreedishps if N<3 , then you are not reading sticks length answered 27 Jun '16, 11:41 9●2 accept rate: 0%
 0 https://www.codechef.com/viewsolution/10627623 Hey, Can anybody tell why I am getting WA ? I used the algorithm mentioned in editorial. answered 27 Jun '16, 12:13 2★chandan5 1●1 accept rate: 0% 1 8 1 1 2 2 2 2 3 3 Answer is 6 = 2 * 3, but your output will be 2 * 2 = 4 (27 Jun '16, 12:26) mgch6★ @mgch Thanks :) (27 Jun '16, 14:50) chandan52★
 0 https://www.codechef.com/viewsolution/10621785 Can somebody please look into it,I am getting a WA. answered 27 Jun '16, 15:59 1★pada1211 1 accept rate: 0%
 toggle preview community wiki:
Preview

### Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• link:[text](http://url.com/ "title")
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×14,487
×1,005
×877
×42
×7

question asked: 25 Jun '16, 12:31

question was seen: 7,043 times

last updated: 06 Jul, 15:24