leetcode/algorithms/cpp/maximumCandiesYouCanGetfromBoxes/maximumCandiesYouCanGetfromBoxes.cpp at main · MichelleZ/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
// Source: https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/
// Author: Miao Zhang
// Date:   2021-04-21

class Solution {
public:
    int maxCandies(vector<int>& status, vector<int>& candies, vector<vector<int>>& keys, vector<vector<int>>& containedBoxes, vector<int>& initialBoxes) {
        queue<int> q;
        vector<int> myBoxes(status.size());
        vector<int> myKeys(status);
        for (int b: initialBoxes) {
            myBoxes[b] = 1;
            if (myKeys[b])
                q.push(b);
        }
        int res = 0;
        while (!q.empty()) {
            int b = q.front();
            q.pop();
            res += candies[b];
            for (int c: containedBoxes[b]) {
                myBoxes[c] = 1;
                if (myKeys[c])
                    q.push(c);
            }
            for (int k: keys[b]) {
                if (!myKeys[k] && myBoxes[k])
                    q.push(k);
                myKeys[k] = 1;
            }
        }
        return res;
    }
};