Cycle HDU - 5215 (奇偶环判定)
题意: 给出无向图,判断是否存在奇环和偶环
思路: 对于奇环,很好判断的是,如果没法进行二分图染色,那么一定存在,问题是对于偶数环,我们可以考虑,奇数环的边数是奇数,假如两个奇数环,那么他们的边数总和就是偶数,现在假如两个奇数环相交那么他们重合的边数*2,再在偶数的基础上减去一个偶数,那么一定是一个偶数,所以只要有环相交就一定存在一个偶环,奉上不知道为什么错的代码。。。希望有佬帮忙看看为什么错。。
#include<bits/stdc++.h>
void solve()
{
int n, m;
std::cin >> n >> m;
std::vector<int> e[n + 1], dep(n + 1), dfn(n + 1), fa(n + 1), col(n + 1);
for (int i = 1; i <= m; i++) {
int u, v;
std::cin >> u >> v;
e[u].push_back(v);
e[v].push_back(u);
}
int dfscnt = 0;
std::function<bool(int, int)> find = [&](int u, int c) {
col[u] = c;
for (int i = 0; i < e[u].size(); i++) {
int v = e[u][i];
if (col[v] == col[u]) return true;
if (!col[v] && find(v, 3 - c)) return true;
}return false;
};
if (find(1, 1)) {std::cout << "YES\n";}
else std::cout << "NO\n";
std::function<void(int, int)> dfs = [&](int u, int f) {
fa[u] = f; dfn[u] = ++dfscnt; dep[u] = dep[f] + 1;
for (int i = 0; i < e[u].size(); i++) {
int v = e[u][i];
if (dep[v]) continue;
dfs(v, u);
}
};
dfs(1, 0);
std::map<std::pair<int, int>, int> mp;
std::function<bool(int, int)> lca = [&](int x, int y) {
if (dep[x] < dep[y]) std::swap(x, y);
int xx = x, yy = y;
int cnt = 0;
while (dep[x] > dep[y]) {
cnt++;
int pa = x;
x = fa[x];
if (mp[{pa, x}]) {return true;}
mp[{pa, x}] = mp[{x, pa}] = 1;
}
while (x != y) {
cnt += 2;
int pa = x;
x = fa[x];
if (mp[{pa, x}]) {return true;}
mp[{pa, x}] = mp[{x, pa}] = 1;
pa = y;
y = fa[y];
if (mp[{pa, y}]) {return true;}
mp[{pa, y}] = mp[{y, pa}] = 1;
}
return (cnt % 2 != 0);
};
std::function<bool()> sol = [&]() {
for (int u = 1; u <= n; u++) {
for (int i = 0; i < e[u].size(); i++) {
int v = e[u][i];
if (dfn[u] < dfn[v] || fa[u] == v || fa[v] == u) continue;
if (lca(u, v)) return true;
}
}return false;
};
if (sol()) std::cout << "YES\n";
else std::cout << "NO\n";
}
int main()
{
std::ios::sync_with_stdio(0);
std::cin.tie(0), std::cout.tie(0);
int T;
std::cin >> T;
while (T--) solve();
return 0;
}