Tasks Details
medium
Given N rectangular buildings of width 1, find the minimum total area of two rectangular banners that cover all of the buildings.
Task Score
75%
Correctness
100%
Performance
50%
There are N rectangular buildings standing along the road next to each other. The K-th building is of size H[K] × 1.
Because a renovation of all of the buildings is planned, we want to cover them with rectangular banners until the renovations are finished. Of course, to cover a building, the banner has to be at least as high as the building. We can cover more than one building with a banner if it is wider than 1.
For example, to cover buildings of heights 3, 1, 4 we could use a banner of size 4×3 (i.e. of height 4 and width 3), marked here in blue:
We can order at most two banners and we want to cover all of the buildings. Also, we want to minimize the amount of material needed to produce the banners.
What is the minimum total area of at most two banners which cover all of the buildings?
Write a function:
int solution(vector<int> &H);
that, given an array H consisting of N integers, returns the minimum total area of at most two banners that we will have to order.
Examples:
1. Given H = [3, 1, 4], the function should return 10. The result can be achieved by covering the first two buildings with a banner of size 3×2 and the third building with a banner of size 4×1:
2. Given H = [5, 3, 2, 4], the function should return 17. The result can be achieved by covering the first building with a banner of size 5×1 and the other buildings with a banner of size 4×3:
3. Given H = [5, 3, 5, 2, 1], your function should return 19. The result can be achieved by covering the first three buildings with a banner of size 5×3 and the other two with a banner of size 2×2:
4. Given H = [7, 7, 3, 7, 7], your function should return 35. The result can be achieved by using one banner of size 7×5:
5. Given H = [1, 1, 7, 6, 6, 6], your function should return 30. The result can be achieved by using banners of size 1×2 and 7×4:
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array H is an integer within the range [1..10,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C++
Time spent on task 69 minutes
Notes
not defined yet
Code: 12:29:19 UTC,
java,
autosave
Code: 12:33:36 UTC,
cpp,
autosave
Code: 12:35:44 UTC,
cpp,
autosave
Code: 12:36:04 UTC,
cpp,
autosave
Code: 12:36:16 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner;
std::set<int> rightBanner;
}
Code: 12:36:37 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner(vector.begin(), vector.end());
std::set<int> rightBanner;
}
Code: 12:36:48 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(vector.begin(), vector.end());
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:10:37: error: missing template arguments before '.' token
std::set<int> rightBanner(vector.begin(), vector.end());
^
func.cpp:10:53: error: missing template arguments before '.' token
std::set<int> rightBanner(vector.begin(), vector.end());
^
func.cpp:12:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
Code: 12:36:59 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 10
1.
0.001 s
WRONG ANSWER,
got 0 expected 17
1.
0.001 s
WRONG ANSWER,
got 0 expected 19
1.
0.001 s
WRONG ANSWER,
got 0 expected 35
1.
0.001 s
WRONG ANSWER,
got 0 expected 30
Code: 12:37:21 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
mi
}
Code: 12:37:47 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::max
}
Code: 12:38:22 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
<limits.h>.
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::max
}
Code: 12:38:34 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
#include <limits>.
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::max
}
Code: 12:39:13 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
#include <limits>.
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = max
}
Code: 12:39:20 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max()
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:13:1: error: expected ',' or ';' before '}' token
}
^
func.cpp:12:9: warning: unused variable 'minimum' [-Wunused-variable]
int minimum = std::numeric_limits<int>::max()
^~~~~~~
func.cpp:13:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
Code: 12:39:29 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 10
1.
0.001 s
WRONG ANSWER,
got 0 expected 17
1.
0.001 s
WRONG ANSWER,
got 0 expected 19
1.
0.001 s
WRONG ANSWER,
got 0 expected 35
1.
0.001 s
WRONG ANSWER,
got 0 expected 30
Code: 12:39:44 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(v)
}
Code: 12:40:01 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
}
}
Code: 12:40:23 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
minimum = std::min
}
}
Code: 12:40:46 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
minimum = std::min()
}
}
Code: 12:40:56 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
minimum = std::min(minimum, )
}
}
Code: 12:41:08 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
minimum = std::min(minimum, leftBanner.size()*)
}
}
Code: 12:41:32 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int area = leftBanner.size()*
minimum = std::min(minimum, )
}
}
Code: 12:41:54 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int area =
minimum = std::min(minimum, )
}
}
Code: 12:42:13 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.size() ? leftBanner
minimum = std::min(minimum, )
}
}
Code: 12:42:23 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.size() ? leftBanner.size()*
minimum = std::min(minimum, )
}
}
Code: 12:42:39 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.size() ? leftBanner.size()*leftBanner.
minimum = std::min(minimum, )
}
}
Code: 12:42:49 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::set<int> leftBanner();
std::set<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.size() ? leftBanner.size()*leftBanner.
minimum = std::min(minimum, )
}
}
Code: 12:43:00 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.size() ? leftBanner.size()*leftBanner.
minimum = std::min(minimum, )
}
}
Code: 12:44:15 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.em() ? leftBanner.size()*leftBanner.
minimum = std::min(minimum, )
}
}
Code: 12:44:34 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*leftBanner.rbegin());.
minimum = std::min(minimum, )
}
}
Code: 12:44:44 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
minimum = std::min(minimum, )
}
}
Code: 12:45:03 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
minimum = std::min(minimum, )
}
}
Code: 12:45:14 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, )
}
}
Code: 12:45:30 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
}
}
Code: 12:46:51 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
}
}
Code: 12:47:23 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
le
}
}
Code: 12:47:34 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.remove
}
}
Code: 12:52:19 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
s.erase(s.lower_bound(value));
}
}
Code: 12:52:44 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.erase(leftBanner.lower_bound(value));
rightBanner.insert()
}
}
Code: 12:52:54 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val)
}
}
Code: 12:53:09 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
#include <algorithm>
#include <multiset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val);
}
return minumum;
}
Analysis
Compile error
func.cpp:3:20: fatal error: multiset: No such file or directory
#include <multiset>
^
compilation terminated.
Code: 12:53:32 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <mset>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val);
}
return minumum;
}
Code: 12:53:34 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val);
}
return minumum;
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:15:32: error: request for member 'empty' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
^~~~~
func.cpp:15:57: error: request for member 'size' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
^~~~
func.cpp:15:77: error: request for member 'rbegin' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
^~~~~~
func.cpp:18:20: error: request for member 'erase' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
leftBanner.erase(leftBanner.lower_bound(val));
^~~~~
func.cpp:18:37: error: request for member 'lower_bound' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
leftBanner.erase(leftBanner.lower_bound(val));
^~~~~~~~~~~
func.cpp:21:12: error: 'minumum' was not declared in this scope
return minumum;
^~~~~~~
Code: 12:55:12 UTC,
cpp,
autosave
// you can use includes, for example:
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val);
}
return minumum;
}
Code: 12:55:14 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner();
std::multiset<int> rightBanner(H.begin(),H.end());
int minimum = std::numeric_limits<int>::max();
for(int val: H){
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size()*(*rightBanner.rbegin());
minimum = std::min(minimum, Larea*Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val);
}
return minumum;
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:16:32: error: request for member 'empty' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
^~~~~
func.cpp:16:57: error: request for member 'size' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
^~~~
func.cpp:16:77: error: request for member 'rbegin' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
int Larea = leftBanner.empty() ? 0 : leftBanner.size()*(*leftBanner.rbegin());
^~~~~~
func.cpp:19:20: error: request for member 'erase' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
leftBanner.erase(leftBanner.lower_bound(val));
^~~~~
func.cpp:19:37: error: request for member 'lower_bound' in 'leftBanner', which is of non-class type 'std::multiset<int>()'
leftBanner.erase(leftBanner.lower_bound(val));
^~~~~~~~~~~
func.cpp:22:12: error: 'minumum' was not declared in this scope
return minumum;
^~~~~~~
Code: 13:01:00 UTC,
cpp,
autosave
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner;
std::multiset<int> rightBanner(H.begin(), H.end());
int minimum = std::numeric_limits<int>::max();
for (int val : H)
{
int Larea = leftBanner.empty() ? 0 : leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea * Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val);
}
return minimum;
}
Code: 13:01:06 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> leftBanner;
std::multiset<int> rightBanner(H.begin(), H.end());
int minimum = std::numeric_limits<int>::max();
for (int val : H)
{
int Larea = leftBanner.empty() ? 0 : leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.empty() ? 0 : rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea * Rarea);
leftBanner.erase(leftBanner.lower_bound(val));
rightBanner.insert(val);
}
return minimum;
}
Analysis
expand all
Example tests
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
Code: 13:17:43 UTC,
cpp,
autosave
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea * Rarea);
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
}
return minimum;
}
Code: 13:17:46 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea * Rarea);
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
}
return minimum;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 11 expected 10
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 20 expected 19
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 35 expected 30
Code: 13:33:28 UTC,
cpp,
autosave
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea + Rarea);
}
return minimum;
}
Code: 13:33:32 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea + Rarea);
}
return minimum;
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Fault
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Fault
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Fault
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Fault
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Fault
Code: 13:37:18 UTC,
cpp,
autosave
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea + Rarea);
}
return minimum;
}
Code: 13:37:22 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
--size;
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea + Rarea);
}
return minimum;
}
Code: 13:37:46 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
--size;
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea + Rarea);
}
return minimum;
}
Code: 13:37:51 UTC,
cpp,
final,
score:
75
// you can use includes, for example:
#include <iostream>
#include <algorithm>
#include <set>
#include <limits>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &H) {
// write your code in C++14 (g++ 6.2.0)
auto size = H.size();
if (size == 1)
return H[0];
if (size == 2)
return H[0] + H[1];
std::multiset<int> leftBanner({*H.begin()}); //first element
std::multiset<int> rightBanner(++H.begin(), H.end()); //rest
int minimum = 1 * (*leftBanner.begin()) + rightBanner.size() * (*rightBanner.rbegin());
--size;
for (std::size_t i = 1; i < size; ++i)
{
int val = H[i];
auto it = rightBanner.lower_bound(val);
rightBanner.erase(it);
leftBanner.insert(val);
int Larea = leftBanner.size() * (*leftBanner.rbegin());
int Rarea = rightBanner.size() * (*rightBanner.rbegin());
minimum = std::min(minimum, Larea + Rarea);
}
return minimum;
}
Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N) or O(N + max(H))
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
6.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
6.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
expand all
Performance tests
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
random_max
Random maximum tests. N=100,000.
Random maximum tests. N=100,000.
✘
TIMEOUT ERROR
running time: 0.104 sec., time limit: 0.100 sec.
running time: 0.104 sec., time limit: 0.100 sec.
1.
0.104 s
TIMEOUT ERROR,
running time: 0.104 sec., time limit: 0.100 sec.
2.
0.104 s
TIMEOUT ERROR,
running time: 0.104 sec., time limit: 0.100 sec.
3.
0.104 s
TIMEOUT ERROR,
running time: 0.104 sec., time limit: 0.100 sec.
4.
0.104 s
TIMEOUT ERROR,
running time: 0.104 sec., time limit: 0.100 sec.
1.
0.040 s
OK
2.
0.040 s
OK
3.
0.060 s
OK
4.
0.064 s
OK
5.
0.088 s
OK
6.
0.088 s
OK
max_pyramid
Values in the tests are arranged into ascending or descending pyramids. N=100,000.
Values in the tests are arranged into ascending or descending pyramids. N=100,000.
✔
OK
1.
0.040 s
OK
2.
0.040 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
5.
0.040 s
OK
1.
0.044 s
OK
2.
0.048 s
OK
3.
0.044 s
OK
4.
0.048 s
OK
5.
0.108 s
TIMEOUT ERROR,
running time: 0.108 sec., time limit: 0.100 sec.
6.
0.048 s
OK
7.
0.044 s
OK