Tasks Details
medium
1.
DoubleHanoi
Find the maximum number of disks that can be placed on two rods. The disks should be in decreasing order of size on the first rod and in increasing order of size on the second rod.
Task Score
100%
Correctness
100%
Performance
100%
You are given N disks and two rods, each with one initial disk.
On the left rod, disks can be placed in decreasing order of size (smaller disks on top of bigger ones). On the right rod, disks can be placed in increasing order of size (bigger disks on top of smaller ones). Note that it is not permissible to place two disks of equal size on top of each other. The initial disks cannot be moved.
Write a function:
int solution(vector<int> &A, int L, int R);
that, given an array A of integers representing the sizes of the N disks and two integers L and R representing the size of the initial disks on the left and right rods respectively, returns the maximum number of disks from A that can be placed on the rods while satisfying the rules presented above.
Examples:
1. Given A = [2, 3, 3, 4], L = 3 and R = 1, your function should return 3, since only three disks can be placed on the rods. Note that the disk of size 2 can be placed on either the left rod or the right rod.
2. Given A = [1, 4, 5, 5], L = 6 and R = 4, your function should return 4.
3. Given A = [5, 2, 5, 2], L = 8 and R = 1, your function should return 4.
4. Given A = [1, 5, 5], L = 2 and R = 4, your function should return 2.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..50,000];
- each element of array A is an integer within the range [1..1,000,000,000];
- L and R are integers within the range [1..1,000,000,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 48 minutes
Notes
not defined yet
Code: 02:47:10 UTC,
java,
autosave
Code: 02:47:23 UTC,
cpp,
autosave
Code: 02:51:48 UTC,
cpp,
autosave
Code: 03:00:40 UTC,
cpp,
autosave
Code: 03:00:50 UTC,
cpp,
autosave
Code: 03:01:03 UTC,
cpp,
autosave
Code: 03:01:47 UTC,
cpp,
autosave
Code: 03:02:02 UTC,
cpp,
autosave
Code: 03:04:27 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
for (auto &i : A)
}
Code: 03:04:40 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<typename _Key>
for (auto &i : A)
}
Code: 03:04:51 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
}
Code: 03:05:02 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
sorted.
}
Code: 03:05:37 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
sorted.i
}
Code: 03:05:48 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
sorted.insert
}
Code: 03:07:42 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
sorted.inse
}
Code: 03:07:53 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
}
}
Code: 03:08:08 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
}
}
Code: 03:10:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
}
}
Code: 03:10:47 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
}
}
Code: 03:11:16 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
}
}
Code: 03:11:47 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
if (i)
}
}
Code: 03:12:03 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
if (i < L)
}
}
Code: 03:12:21 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short count
if (i < L)
}
}
Code: 03:12:51 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > )
}
}
Code: 03:13:02 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
}
}
Code: 03:13:16 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<
}
}
Code: 03:13:53 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<
}
}
Code: 03:14:11 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
typedef std::set<int>
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<
}
}
Code: 03:14:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
typedef std::multiset<int>::iterator
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<
}
}
Code: 03:14:35 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<
}
}
Code: 03:14:45 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It>
}
}
Code: 03:14:58 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range()
}
}
Code: 03:15:08 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range(i);
}
}
Code: 03:25:13 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range(i);
if
}
}
Code: 03:25:33 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range(i);
if (std::)
}
}
Code: 03:25:44 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range(i);
if (std::count )
}
}
Code: 03:26:17 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range(i);
if (std::count \)
}
}
Code: 03:26:32 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()))
}
}
Code: 03:26:51 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
}
}
Code: 03:27:21 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
}
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
}
}
Code: 03:27:32 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
}
}
}
Code: 03:27:43 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
}
}
}
Code: 03:27:54 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.insert
}
}
}
Code: 03:28:05 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.insert()
}
}
}
Code: 03:28:54 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.inser
}
}
}
Code: 03:29:09 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.emplace_hint(test.second(), _Args &&__args...)
}
}
}
Code: 03:29:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.emplace_hint(test.second(), i);
}
}
}
Code: 03:30:53 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.emplace_hint(test.second(), i);
}
}
}
Code: 03:31:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.emplace_hint(test.second(), i);
}
}
return sorted.size();
}
Code: 03:31:13 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first(), test.second()) < limit)
sorted.emplace_hint(test.second(), i);
}
}
return sorted.size();
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&, int, int)':
func.cpp:26:39: error: no match for call to '(std::_Rb_tree_const_iterator<int>) ()'
if (std::count(test.first(), test.second()) < limit)
^
func.cpp:26:54: error: no match for call to '(std::_Rb_tree_const_iterator<int>) ()'
if (std::count(test.first(), test.second()) < limit)
^
func.cpp:27:49: error: no match for call to '(std::_Rb_tree_const_iterator<int>) ()'
sorted.emplace_hint(test.second(), i);
^
Code: 03:32:23 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first, test.second()) < limit)
sorted.emplace_hint(test.second(), i);
}
}
return sorted.size();
}
Code: 03:32:31 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first, test.second) < limit)
sorted.emplace_hint(test.second, i);
}
}
return sorted.size();
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&, int, int)':
func.cpp:26:51: error: no matching function for call to 'count(std::_Rb_tree_const_iterator<int>&, std::_Rb_tree_const_iterator<int>&)'
if (std::count(test.first, test.second) < limit)
^
In file included from /opt/lang/gcc/include/c++/6.2.0/algorithm:62:0,
from func.cpp:9:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algo.h:3961:5: note: candidate: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algo.h:3961:5: note: template argument deduction/substitution failed:
func.cpp:26:51: note: candidate expects 3 arguments, 2 provided
if (std::count(test.first, test.second) < limit)
^
Code: 03:34:05 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first, test.second,) < limit)
sorted.emplace_hint(test.second, i);
}
}
return sorted.size();
}
Code: 03:34:08 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first, test.second, i) < limit)
sorted.emplace_hint(test.second, i);
}
}
return sorted.size();
}
Analysis
Code: 03:34:57 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first, test.second, i) < limit)
sorted.emplace_hint(test.second, i);
}
}
return sorted.size();
}
Analysis
Code: 03:35:01 UTC,
cpp,
final,
score:
100
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <set>
#include <utility>
#include <algorithm>
typedef std::multiset<int>::iterator It;
int solution(vector<int> &A, int L, int R) {
// write your code in C++14 (g++ 6.2.0)
std::multiset<int> sorted;
for (auto &i : A)
{
short limit = 0;
if (i < L)
limit++;
if (i > R)
limit++;
if (limit > 0)
{
std::pair<It, It> test = sorted.equal_range(i);
if (std::count(test.first, test.second, i) < limit)
sorted.emplace_hint(test.second, i);
}
}
return sorted.size();
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N)) or O(N)
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
1.
0.001 s
OK
2.
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
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
small_every_value_occurs_more_than_once
Small random tests, every value occurs at least twice. N = 100.
Small random tests, every value occurs at least twice. N = 100.
✔
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
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
Correctness/performance tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.004 s
OK
5.
0.004 s
OK
6.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.012 s
OK
5.
0.012 s
OK
6.
0.012 s
OK
expand all
Performance tests
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
6.
0.001 s
OK
1.
0.020 s
OK
2.
0.020 s
OK
3.
0.004 s
OK
4.
0.004 s
OK