<p>You are given an integer <code>n</code>, the number of nodes in a directed graph where the nodes are labeled from <code>0</code> to <code>n - 1</code>. Each edge is red or blue in this graph, and there could be self-edges and parallel edges.</p>

<p>You are given two arrays <code>redEdges</code> and <code>blueEdges</code> where:</p>

<ul>
	<li><code>redEdges[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that there is a directed red edge from node <code>a<sub>i</sub></code> to node <code>b<sub>i</sub></code> in the graph, and</li>
	<li><code>blueEdges[j] = [u<sub>j</sub>, v<sub>j</sub>]</code> indicates that there is a directed blue edge from node <code>u<sub>j</sub></code> to node <code>v<sub>j</sub></code> in the graph.</li>
</ul>

<p>Return an array <code>answer</code> of length <code>n</code>, where each <code>answer[x]</code> is the length of the shortest path from node <code>0</code> to node <code>x</code> such that the edge colors alternate along the path, or <code>-1</code> if such a path does not exist.</p>

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

<pre>
<strong>Input:</strong> n = 3, redEdges = [[0,1],[1,2]], blueEdges = []
<strong>Output:</strong> [0,1,-1]
</pre>

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

<pre>
<strong>Input:</strong> n = 3, redEdges = [[0,1]], blueEdges = [[2,1]]
<strong>Output:</strong> [0,1,-1]
</pre>

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

<ul>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>0 &lt;= redEdges.length,&nbsp;blueEdges.length &lt;= 400</code></li>
	<li><code>redEdges[i].length == blueEdges[j].length == 2</code></li>
	<li><code>0 &lt;= a<sub>i</sub>, b<sub>i</sub>, u<sub>j</sub>, v<sub>j</sub> &lt; n</code></li>
</ul>

class Solution {
public:
    vector<int> shortestAlternatingPaths(int n, vector<vector<int>>& redEdges, vector<vector<int>>& blueEdges) {
        unordered_map<int, vector<int>> red;
        unordered_map<int, vector<int>> blue;
        for (auto edge : redEdges) {
            red[edge[0]].push_back(edge[1]);
        }
        for (auto edge : blueEdges) {
            blue[edge[0]].push_back(edge[1]);
        }

        vector<int> ans={0};
        for (int i = 1; i < n; i++) {
            queue<vector<int>> q;
            vector<bool> visiteda(n, false);
            vector<bool> visitedb(n, false);
            visiteda[0] = true;
            visitedb[0] = true;
            q.push({0, -1});
            int c = 0;
            int flag = 0;

            while (!q.empty() && flag == 0) {
                int size = q.size(); // Correct variable name to avoid conflict
                for (int j = 0; j < size; j++) {
                    auto elem = q.front();
                    int node = elem[0];
                    int color = elem[1];
                    q.pop(); // Move q.pop() before accessing the element

                    if (node == i) {
                        ans.push_back(c);
                        flag = 1;
                        break;
                    }

                    if (color == 1 || color == -1) {
                        for (auto j : red[node]) {
                            if (visiteda[j]) continue;
                            q.push({j, 0});
                            visiteda[j] = true;
                        }
                    }

                    if (color == 0 || color == -1) {
                        for (auto j : blue[node]) {
                            if (visitedb[j]) continue;
                            q.push({j, 1});
                            visitedb[j] = true;
                        }
                    }
                }
                c++;
            }

            if (flag == 0) ans.push_back(-1);
        }
        return ans;
    }
};

30280