<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 findcomone(int a, int b){
        int c = a&b;
        int co = 0;
        while(c!=0){
            co+=(c&1);
            c>>=1;
        }
        return co;
    }

    pair<int,vector<int>> helper(int n, int skill, vector<int>& peopmap, vector<unordered_map<int,pair<int,vector<int>>>>& v){
        if(skill==0){
            return {0,vector<int>()};
        }
        if(n>=peopmap.size()){
            return {INT_MAX,vector<int>()};
        }
        if(v[n].find(skill)!=v[n].end()){
            return v[n][skill];
        }
        int val1 = skill&(peopmap[n]^((1<<20)-1));
        auto p1 = helper(n+1,val1,peopmap,v);
        auto p2 = helper(n+1,skill,peopmap,v);
        if(p1.first<p2.first){
            p1.second.push_back(n);
            p1.first++;
            v[n][skill] = p1;
            return p1;
        }
        v[n][skill] = p2;
        return p2;

        
    }

    vector<int> smallestSufficientTeam(vector<string>& req_skills, vector<vector<string>>& people) {
        map<string,int> m;
        int skil = req_skills.size();
        int peop = people.size();
        vector<int> peopmap(peop);
        vector<bool> incl(peop,false);
        int curr = 1;
        for(int j=0;j<skil;j++){
            m[req_skills[j]] = curr;
            curr<<=1;
        }
        for(int j=0;j<peop;j++){
            int curr = 0x0;
            for(int k=0;k<people[j].size();k++){
                curr|=m[people[j][k]];
            }
            peopmap[j] = curr;
        }

        vector<unordered_map<int,pair<int,vector<int>>>> v(peop);
        auto a = helper(0,(1<<skil)-1,peopmap,v);
        return a.second;





    }
};
194468