vector<int>& candies,

vector<vector<int>>& keys,

vector<vector<int>>& containedBoxes,

vector<int>& initialBoxes)

{

int sumOfCandies = 0;

std::queue<int> openedBoxes; // 已打开的盒子

vector<bool> reachableButClosedBoxes(status.size(), false); // 能接触到但未打开的盒子

for (auto &box : initialBoxes) {

if (status[box]) {

openedBoxes.push(box);

} else {

reachableButClosedBoxes[box] = true;

}

}

while (!openedBoxes.empty()) {

sumOfCandies += candies[openedBoxes.front()];

for (auto &box : keys[openedBoxes.front()]) {

if (reachableButClosedBoxes[box]) {

openedBoxes.push(box);

reachableButClosedBoxes[box] = false;

}

status[box] = 1;

}

for (auto &box : containedBoxes[openedBoxes.front()]) {

if (status[box]) {

openedBoxes.push(box);

} else {

reachableButClosedBoxes[box] = true;

}

}

openedBoxes.pop();

}

return sumOfCandies;