NC52275 图的遍历

dfs判断奇数偶数环

图的遍历 (nowcoder.com)

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define ss second
#define ff first
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
const int N = 2e6 + 10;
struct node
{
    int to, nxt;
} e[N];
int h[N];
int tot = 0;
int n, m;
int vis[N];
void add(int u, int v)
{
    e[++tot].to = v;
    e[tot].nxt = h[u];
    h[u] = tot;
}
int f = 0;
void dfs(int x)
{
    for (int i = h[x]; i != 0; i = e[i].nxt)
    {
        int v = e[i].to;
        if (!vis[v])
        {
            vis[v] = vis[x] + 1;
            dfs(v);
        }
        else
        {
            if ((vis[v] - vis[x]) % 2 == 0)
            {
                f = 1;
            }
        }
    }
}
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v;
        add(u, v);
        add(v, u);
    }
    int cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        if (vis[i] == 0)
        {
            vis[i] = 1;
            dfs(i);
            cnt++;
        }
    }
    cnt--;
    if (f == 1)
        cout << cnt << endl;
    else
        cout << cnt + 1 << endl;
}
signed main()
{
    IOS;
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++)
    {
        // cout << "Case #" << i << ": ";
        solve();
    }
    return 0;
}