The Diet Plan Problem - TCS CodeVita

Examples

Example 1

Input

100P 130C 130F
10P 20C 30F|20P 30C 20F

Output

20 0 10

Explanation

Having 2 units of item A and 3 units of item B provides - 2 * [10P 20C 30F] + 3 * [20P 30C 20F] = 100P, 130C, 120F. This is the best combination that can reduce the shortfall [20P, 0C, 10F] without exceeding his prescription. In contrast, if 3 units of A and 2 units of B are chosen then 3 * [10P 20C 30F] + 2 * [20P 30C 20F] = 70P, 120C, 130F produces a shortfall of [30P, 10C, 0F]. However, since protein shortfall in this case is more than the previous combination, this is not the right combination to follow.

Example 2

Input

130P 120C 110F
4P 9C 2F|4P 3C 2F|7P 1C 3F

Output

2 4 50

Explanation

Having 9 units of item A, 9 units of item B and 8 units of Item C provides - 9 * [4P 9C 2F] + 9 * [4P 3C 2F] + 8 * [7P 1C 3F] = 108P, 116C, 60F. This is the best combination that can reduce the shortfall [2P, 4C, 50F] without exceeding his prescription.

Solution

Implementation in C++ 

The following code illustrates the solution in C++ :

#include<bits/stdc++.h>
using namespace std;
typedef  long long  ll;
ll inf=1000000000000000000,mod=1000000007,BS,k;
#define en printf("\n");
int main(){
        string a,b;
        cin>>a;
        int res=0,p,c,f,a_len,b_len;
        a_len=a.length();
        for(int i=0;i<a_len;i++){
            if(a[i]==' ')continue;
            if(isdigit(a[i])){
                res=res*10+a[i]-'0';
            }
            else{
                if(a[i]=='P')
                p=res;
                else if(a[i]=='C')
                c=res;
                else
                f=res;
                res=0;
            }
        }
        cin>>b;
        int pp,cc,ff;
        vector<pair<int,pair<int,int>>>ans;res=0;
        int mi=INT_MAX,sump=0,sumc=0,sumf=0;
        b_len=b.length();
        for(int i=0;i<b_len;i++){
            if(b[i]==' ')continue;
            if(b[i]=='|'){
                ans.push_back({pp,{cc,ff}});
                pp=0;ff=0;cc=0;
            }
            if(isdigit(b[i])){
                res=res*10+b[i]-'0';
            }
            else{
                if(b[i]=='P')
                pp=res,sump+=pp;
                else if(b[i]=='C')
                cc=res,sumc+=cc;
                else
                ff=res,sumf+=ff;
                res=0;
            }
        }ans.push_back({pp,{cc,ff}});
        if(sump)
        mi=min(mi,p/sump);
        if(sumc)
        mi=min(mi,c/sumc);
        if(sumf)
        mi=min(mi,f/sumf);
        if(mi==INT_MAX)mi=0;
        int nn=ans.size();
        pair<int,pair<int,int>>lef,ma={0,{0,0}},curr;
        lef={p-mi*sump,{c-mi*sumc,f-mi*sumf}};
        for(int i=0;i<(1<<nn);i++){
            curr={0,{0,0}};
            for(int j=0;j<nn;j++){
                if(i&(1<<j))
                {
                    curr.first+=ans[j].first;
                    curr.second.first+=ans[j].second.first;
                    curr.second.second+=ans[j].second.second;
                }
            }
            if(curr.first<=lef.first&&curr.second.first<=lef.second.first&&curr.second.second<=lef.second.second)
            ma=max(ma,curr);
        }
        cout<<p-sump*mi-ma.first<<" "<<c-sumc*mi-ma.second.first<<" "<<f-sumf*mi-ma.second.second<<endl;
    return 0;
}

You can also try this code with Online C++ Compiler

Run Code

FAQs

1. What is TCS Codevita?
   The Pre-Qualifier Round, the Qualifier Round, and the Grand Finale are the three major rounds of Codevita, an online coding competition. 1. Pre-Qualifier Round: This will be an online coding competition in which players will have 6 hours to complete questions.
    
2. What are the requirements for TCS Codevita participation?
   The Codevita competition is open to students from India's institutes who will finish their academic degrees in 2022, 2023, 2024, or 2025.
    
3. What languages will we be able to code in the exam?
   The languages that we can use are as follows: C, C++, C#, Java, Perl, PHP, Python, and Ruby.

Key Takeaways

In this article, we have extensively discussed the problem Diet Plan asked in TCs Codevita 2021.The article explains the details of the problem statement along with the problem statement and its implementation in C++.

Check out TCS Interview Experience to learn about TCS’s hiring process.
We hope that this blog has helped you enhance your knowledge regarding Diet Plan problem asked in TCS Codevita2021 and if you would like to learn more, visit Coding Ninjas Studio, our practice platform, to practise top problems, take mock tests, read interview experiences, and much more technical stuff.
Do upvote our blog to help other ninjas grow. 
Happy Coding!