851. Loud and Rich Medium

1/**
2 * [851] Loud and Rich
3 *
4 * There is a group of n people labeled from 0 to n - 1 where each person has a different amount of money and a different level of quietness.
5 * You are given an array richer where richer[i] = [ai, bi] indicates that ai has more money than bi and an integer array quiet where quiet[i] is the quietness of the i^th person. All the given data in richer are logically correct (i.e., the data will not lead you to a situation where x is richer than y and y is richer than x at the same time).
6 * Return an integer array answer where answer[x] = y if y is the least quiet person (that is, the person y with the smallest value of quiet[y]) among all people who definitely have equal to or more money than the person x.
7 *  
8 * Example 1:
9 * 
10 * Input: richer = [[1,0],[2,1],[3,1],[3,7],[4,3],[5,3],[6,3]], quiet = [3,2,5,4,6,1,7,0]
11 * Output: [5,5,2,5,4,5,6,7]
12 * Explanation: 
13 * answer[0] = 5.
14 * Person 5 has more money than 3, which has more money than 1, which has more money than 0.
15 * 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.
16 * answer[7] = 7.
17 * 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.
18 * The other answers can be filled out with similar reasoning.
19 * 
20 * Example 2:
21 * 
22 * Input: richer = [], quiet = [0]
23 * Output: [0]
24 * 
25 *  
26 * Constraints:
27 * 
28 * 	n == quiet.length
29 * 	1 <= n <= 500
30 * 	0 <= quiet[i] < n
31 * 	All the values of quiet are unique.
32 * 	0 <= richer.length <= n * (n - 1) / 2
33 * 	0 <= ai, bi < n
34 * 	ai != bi
35 * 	All the pairs of richer are unique.
36 * 	The observations in richer are all logically consistent.
37 * 
38 */
39pub struct Solution {}
40
41// problem: https://leetcode.com/problems/loud-and-rich/
42// discuss: https://leetcode.com/problems/loud-and-rich/discuss/?currentPage=1&orderBy=most_votes&query=
43
44// submission codes start here
45
46impl Solution {
47    pub fn loud_and_rich(richer: Vec<Vec<i32>>, quiet: Vec<i32>) -> Vec<i32> {
48        vec![]
49    }
50}
51
52// submission codes end
53
54#[cfg(test)]
55mod tests {
56    use super::*;
57
58    #[test]
59    fn test_851() {
60    }
61}
62