Tasks Details
medium
1.
Multivitamin
There are N glasses of different capacities, each of them containing a different amount of a unique kind of juice. Calculate the maximum number of kinds of juice that can be mixed in a single glass.
Task Score
100%
Correctness
100%
Performance
100%
Rick is really fond of fruit juices, but he is bored of their traditional flavours. Therefore, he has decided to mix as many of them as possible to obtain something entirely new as a result.
He has N glasses, numbered from 0 to N-1, each containing a different kind of juice. The J-th glass has capacity[J] units of capacity and contains juice[J] units of juice. In each glass there is at least one unit of juice.
Rick want to create a multivitamin mix in one of the glasses. He is going to do it by pouring juice from several other glasses into the chosen one. Each of the used glasses must be empty at the end (all of the juice from each glass has to be poured out).
What is the maximum number of flavours that Rick can mix?
Write a function:
int solution(vector<int> &juice, vector<int> &capacity);
that, given arrays juice and capacity, both of size N, returns the maximum number of flavours that Rick can mix in a single glass.
Examples:
1. Given juice = [10, 2, 1, 1] and capacity = [10, 3, 2, 2], your function should return 2. Rick can pour juice from the 3rd glass into the 2nd one.
2. Given juice = [1, 2, 3, 4] and capacity = [3, 6, 4, 4], your function should return 3. Rick can pour juice from the 0th and 2nd glasses into the 1st one.
3. Given juice = [2, 3] and capacity = [3, 4], your function should return 1. No matter which glass he chooses, Rick cannot pour juice from the other one into it. The maximum number of flavours in the chosen glass is 1.
4. Given juice = [1, 1, 5] and capacity = [6, 5, 8], your function should return 3. Rick can mix all juices in the 2nd glass.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [2..100,000];
- each element of arrays juice and capacity is an integer within the range [1..1,000,000,000];
- arrays juice and capacity have the same length, equal to N;
- for each J juice[J] ≤ capacity[J].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C++
Time spent on task 8 minutes
Notes
not defined yet
Code: 00:04:36 UTC,
java,
autosave
Code: 00:04:43 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
diff = capacity[i]-juice[i];
index = i;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
//cout<<diff;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:04:59 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
diff = capacity[i]-juice[i];
index = i;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:05:15 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:05:45 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if(capacity[i]-juice[i]>nextdiff) && (capacity[i]-)
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:05:55 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if(capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<)
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:06:25 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:06:35 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:06:49 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:07:00 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:07:29 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
{
v.push_back(juice[i]);
}
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:07:39 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:07:53 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:08:03 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:08:18 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:08:45 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con>n)
return n;
return con;
}
Code: 00:08:56 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:08:56 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-diff[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&, std::vector<int>&)':
func.cpp:22:42: error: invalid types 'long long int[long long int]' for array subscript
nextdiff = capacity[i]-diff[i];
^
Code: 00:09:29 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:09:32 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(maxcap<capacity[i])
maxcap = capacity[i];
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Analysis
expand all
Example tests
1.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
Code: 00:09:56 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:10:06 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:10:50 UTC,
cpp,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Analysis
Code: 00:10:58 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:11:11 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
long long int r = 1;
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:11:31 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
long long int r = 1;
for(i=0;i<n;i++)
{
if(i!=)
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:11:45 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
long long int r = 1;
for(i=0;i<n;i++)
{
if(i!=index)
{
if()
}
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:12:04 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
long long int r = 1;
for(i=0;i<n;i++)
{
if(i!=index)
{
if(juice[i]+juice[index]<=capacity[i])
r=2;
}
}
if(con<con1)
con = con1;
if(con>n)
return n;
return con;
}
Code: 00:12:15 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
long long int r = 1;
for(i=0;i<n;i++)
{
if(i!=index)
{
if(juice[i]+juice[index]<=capacity[i])
r=2;
}
}
if(con<con1)
con = con1;
if(con<r)
con=r;
if(con>n)
return n;
return con;
}
Analysis
Code: 00:12:22 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
long long int r = 1;
for(i=0;i<n;i++)
{
if(i!=index)
{
if(juice[i]+juice[index]<=capacity[i])
r=2;
}
}
if(con<con1)
con = con1;
if(con<r)
con=r;
if(con>n)
return n;
return con;
}
Analysis
Code: 00:12:27 UTC,
cpp,
final,
score:
100
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
// you can use includes, for example:
// #include <algorithm>
#include<bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &juice, vector<int> &capacity) {
// write your code in C++14 (g++ 6.2.0)
long long int n=juice.size(),i,diff=0,index=-1,sum=0,con=1,con1=1,maxcap=-1,empty=0,nextdiff=0,ind1=-1;
vector<long long int>v,v1;
for(i=0;i<n;i++)
{
if(capacity[i]-juice[i]>diff)
{
nextdiff = diff;
ind1 = index;
diff = capacity[i]-juice[i];
index = i;
}
else if((capacity[i]-juice[i]>nextdiff) && (capacity[i]-juice[i]<diff))
{
nextdiff = capacity[i]-juice[i];
ind1= i ;
}
if(capacity[i]>juice[i])
empty++;
sum=sum+juice[i];
if(maxcap<capacity[i])
maxcap = capacity[i];
}
if(empty==0)
return 1;
if(sum<=maxcap)
return n;
sum = 0;
for(i=0;i<n;i++)
{
if(i!=index)
v.push_back(juice[i]);
if(i!=ind1)
v1.push_back(juice[i]);
}
sort(v.begin(),v.end());
for(i=0;i<n-1;i++)
{
if(sum+v[i]<=diff)
{
sum=sum+v[i];
con++;
if(sum == diff)
break;
}
else if(sum+v[i]>diff)
break;
}
sum=0;
sort(v1.begin(),v1.end());
for(i=0;i<n-1;i++)
{
if(sum+v1[i]<=nextdiff)
{
sum=sum+v1[i];
con1++;
if(sum == nextdiff)
break;
}
else if(sum+v1[i]>diff)
break;
}
long long int r = 1;
for(i=0;i<n;i++)
{
if(i!=index)
{
if(juice[i]+juice[index]<=capacity[i])
r=2;
}
}
if(con<con1)
con = con1;
if(con<r)
con=r;
if(con>n)
return n;
return con;
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
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
7.
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
not_biggest_capacity
Tests in which the glass with the biggest capacity is not the one that should be picked as the base.
Tests in which the glass with the biggest capacity is not the one that should be picked as the base.
✔
OK
1.
0.001 s
OK
2.
0.001 s
OK
not_biggest_capacity_left
Tests in which the glass with the largest empty space is not the picked as the base.
Tests in which the glass with the largest empty space is not the picked as the base.
✔
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
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
expand all
Performance tests
1.
0.001 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
1.
0.001 s
OK
2.
0.028 s
OK
3.
0.008 s
OK
4.
0.028 s
OK
5.
0.008 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.008 s
OK
5.
0.012 s
OK
1.
0.016 s
OK
2.
0.016 s
OK
1.
0.028 s
OK
2.
0.016 s
OK
3.
0.024 s
OK
4.
0.024 s
OK
5.
0.008 s
OK