<p>There is a group of <code>n</code> people labeled from <code>0</code> to <code>n - 1</code> where each person has a different amount of money and a different level of quietness.</p>

<p>You are given an array <code>richer</code> where <code>richer[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that <code>a<sub>i</sub></code> has more money than <code>b<sub>i</sub></code> and an integer array <code>quiet</code> where <code>quiet[i]</code> is the quietness of the <code>i<sup>th</sup></code> person. All the given data in richer are <strong>logically correct</strong> (i.e., the data will not lead you to a situation where <code>x</code> is richer than <code>y</code> and <code>y</code> is richer than <code>x</code> at the same time).</p>

<p>Return <em>an integer array </em><code>answer</code><em> where </em><code>answer[x] = y</code><em> if </em><code>y</code><em> is the least quiet person (that is, the person </em><code>y</code><em> with the smallest value of </em><code>quiet[y]</code><em>) among all people who definitely have equal to or more money than the person </em><code>x</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> richer = [[1,0],[2,1],[3,1],[3,7],[4,3],[5,3],[6,3]], quiet = [3,2,5,4,6,1,7,0]
<strong>Output:</strong> [5,5,2,5,4,5,6,7]
<strong>Explanation:</strong> 
answer[0] = 5.
Person 5 has more money than 3, which has more money than 1, which has more money than 0.
The only person who is quieter (has lower quiet[x]) is person 7, but it is not clear if they have more money than person 0.
answer[7] = 7.
Among all people that definitely have equal to or more money than person 7 (which could be persons 3, 4, 5, 6, or 7), the person who is the quietest (has lower quiet[x]) is person 7.
The other answers can be filled out with similar reasoning.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> richer = [], quiet = [0]
<strong>Output:</strong> [0]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == quiet.length</code></li>
	<li><code>1 &lt;= n &lt;= 500</code></li>
	<li><code>0 &lt;= quiet[i] &lt; n</code></li>
	<li>All the values of <code>quiet</code> are <strong>unique</strong>.</li>
	<li><code>0 &lt;= richer.length &lt;= n * (n - 1) / 2</code></li>
	<li><code>0 &lt;= a<sub>i</sub>, b<sub>i</sub> &lt; n</code></li>
	<li><code>a<sub>i </sub>!= b<sub>i</sub></code></li>
	<li>All the pairs of <code>richer</code> are <strong>unique</strong>.</li>
	<li>The observations in <code>richer</code> are all logically consistent.</li>
</ul>

// class List
// {
//     public:
//     int val;
//     vector<List*>  ;
    
// }

class Solution {
public:
    
    map<int , vector<int>> edges;
    
    vector<int> store;
    vector<int> vis;
    int set_sound(vector<int>& quiet , int i)
    {
        // cout << i ;
        if(vis[i] != -1)
        {
            return store[i];
        }
        
        int mini = INT_MAX;
        
        
        for(int j = 0 ; j < edges[i].size() ; j++)
        {
            mini = min(mini , set_sound(quiet , edges[i][j]));
        }
        
        if(mini == INT_MAX)
        {
            store[i] = quiet[i];
            mini = quiet[i];
            return mini;
        }
        
        
        mini = min(mini , quiet[i]);
        // cout << "chut " << i << "  ";
        store[i] = mini;
        vis[i] = 0;
        return mini;
        
    }
    
    vector<int> loudAndRich(vector<vector<int>>& richer, vector<int>& quiet) {
        vector<int> stor(quiet.size() , -1);
        store = quiet;
        
        vis = stor;
        set<int> starts;
        for(int i = 0; i<richer.size() ;i++ )
        {
            pair<int ,int> p;
            // p.first = richer[i][0];
            
            
            edges[richer[i][1]].push_back(richer[i][0]);
            starts.insert(richer[i][1]);
        }
        
        for(int i = 0; i<richer.size() ;i++ )
        {
            starts.erase(richer[i][0]);
        }
        
//         for(int j = 0 ; j  < store.size() ; j++)
//         {
//             store[j] = val[i];
//             cout << store[j] << "  ";
//         }
        
        for(auto i : starts)
        {
            set_sound(quiet , i);
        
        }
        
        // for(int j = 0 ; j  < store.size() ; j++)
        // {
        //     cout << store[j] << "  ";
        // }
        
        map<int ,int> val;
        
        for(int j = 0 ; j  < quiet.size() ; j++)
        {
            val[quiet[j]] = j;
        }
        for(int j = 0 ; j  < store.size() ; j++)
        {
            store[j] = val[store[j]];
            // cout << store[j] << "  ";
        }
        
        return store;
        
    }
};
47854