<p>In a project, you have a list of required skills <code>req_skills</code>, and a list of people. The <code>i<sup>th</sup></code> person <code>people[i]</code> contains a list of skills that the person has.</p>

<p>Consider a sufficient team: a set of people such that for every required skill in <code>req_skills</code>, there is at least one person in the team who has that skill. We can represent these teams by the index of each person.</p>

<ul>
	<li>For example, <code>team = [0, 1, 3]</code> represents the people with skills <code>people[0]</code>, <code>people[1]</code>, and <code>people[3]</code>.</li>
</ul>

<p>Return <em>any sufficient team of the smallest possible size, represented by the index of each person</em>. You may return the answer in <strong>any order</strong>.</p>

<p>It is <strong>guaranteed</strong> an answer exists.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> req_skills = ["java","nodejs","reactjs"], people = [["java"],["nodejs"],["nodejs","reactjs"]]
<strong>Output:</strong> [0,2]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> req_skills = ["algorithms","math","java","reactjs","csharp","aws"], people = [["algorithms","math","java"],["algorithms","math","reactjs"],["java","csharp","aws"],["reactjs","csharp"],["csharp","math"],["aws","java"]]
<strong>Output:</strong> [1,2]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= req_skills.length &lt;= 16</code></li>
	<li><code>1 &lt;= req_skills[i].length &lt;= 16</code></li>
	<li><code>req_skills[i]</code> consists of lowercase English letters.</li>
	<li>All the strings of <code>req_skills</code> are <strong>unique</strong>.</li>
	<li><code>1 &lt;= people.length &lt;= 60</code></li>
	<li><code>0 &lt;= people[i].length &lt;= 16</code></li>
	<li><code>1 &lt;= people[i][j].length &lt;= 16</code></li>
	<li><code>people[i][j]</code> consists of lowercase English letters.</li>
	<li>All the strings of <code>people[i]</code> are <strong>unique</strong>.</li>
	<li>Every skill in <code>people[i]</code> is a skill in <code>req_skills</code>.</li>
	<li>It is guaranteed a sufficient team exists.</li>
</ul>

class Solution {
public:
    int solve(vector<int>&pple,int limit,int curr,int ind){
        if(ind==pple.size()){
            if(curr==limit)return 0;
            return INT_MAX;
        }
        
        
        int taken=INT_MAX;
        int ret=solve(pple,limit,curr|pple[ind],ind+1);
        if(ret!=INT_MAX)taken=1+ret;
        int ntaken=solve(pple,limit,curr,ind+1);
        return min(taken,ntaken);
    }
    vector<int> smallestSufficientTeam(vector<string>& req_skills, vector<vector<string>>& people) {
        map<string,int>mp;
        map<int,vector<int>>mpv;
        mpv[0]={};
        for(int i=0;i<req_skills.size();i++)mp[req_skills[i]]=i;
        // vector<int>pple(people.size());
        for(int i=0;i<people.size();i++){
             int bt=0;
             for(int j=0;j<people[i].size();j++){
                bt|=(1<<mp[people[i][j]]);
             }
            //  pple[i]=bt;
            for(auto it=mpv.begin();it!=mpv.end();it++){
                int newTeam=it->first|bt;
                if(mpv.find(newTeam)==mpv.end()){
                   vector<int>v=it->second;
                   v.push_back(i);
                   mpv[newTeam]=v;
                }else{
                   vector<int>v=it->second;
                   v.push_back(i);
                   if(v.size()<mpv[newTeam].size())mpv[newTeam]=v;
                }
            }
        }
        
        return mpv[(1<<req_skills.size())-1];
        
    }
};
127466