LC2493 WA

class Solution {
    vector<int> vis;
    vector<int> color;
    // int nn;
    vector<int> g[501];
    bool check_odd_ring(int u, int c) {
        if (color[u] && color[u] != c) {
            return false;
        }
        color[u] = c;
        vis[u] = 1;
        for (auto v: g[u]) {
            if (vis[v] == 0) {
                check_odd_ring(v, c * -1);
            } else if (color[v] != c * -1) {
                return false;
            }
        }
        return true;
    }
    int bfs(int u) {
        set<int> vv;
        using pii = pair<int, int>;
        queue<pii> q;
        q.push({u, 1});
        int h = 1;
        while(q.empty() == false) {
            auto x = q.front(); q.pop();
            if (vv.count(x.first)) continue;
            h = max(x.second, h);
            vv.insert(x.first);
            for (auto v: g[x.first]) {
                if (vv.count(v) == 0) {
                    q.push({v, x.second + 1});
                }
            }
        }
        return h;
    }
    int height(int u) {
        using pii = pair<int, int>;
        queue<pii> q;
        q.push({u, 1});
        vector<int> nodes;
        int h = 1;
        while(q.empty() == false) {
            auto x = q.front(); q.pop();
            if (vis[x.first]) continue;
            h = max(x.second, h);
            nodes.push_back(x.second);
            vis[x.first] = 1;
            for (auto v: g[x.first]) {
                if (vis[v] == 0) {
                    q.push({v, x.second + 1});
                }
            }
        }
        for (auto x: nodes) {
            h = max(h, bfs(x));
        }
        return h;
    }
public:
    int magnificentSets(int n, vector<vector<int>>& edges) {
        for (const auto& e: edges) {
            auto u = e[0], v = e[1];
            g[u].push_back(v);
            g[v].push_back(u);
        }
        vis = vector<int>(n + 1);
        color = vector<int>(n + 1);
        for (int i = 1; i <= n; ++i) {
            if (vis[i] == 0 && check_odd_ring(i, 1) == false)
                return -1;
        }
        // nn = n;
        int ans = 0;
        vis = vector<int>(n + 1);
        for (int i = 1; i <= n; ++i) {
            if (vis[i] == 0) {
                ans += height(i);
            }
        }
        return ans;
    }
};