Graph Coloring I

Graph Coloring I (nowcoder.com)

题目大意

判断是否为二分图，是就输出每个点的颜色，不是就输出最长奇数环的路径

#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#define dbg(x) cout << #x << '=' << x << endl
#define FA ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
using namespace std;
const int N = 3e5 + 10, M = 2 * N, mod = 1e9 + 7;
const double eps = 1e-8;
typedef long long LL;
typedef pair<int, int> PII;

int h[N], e[M], ne[M], idx;
int color[N];
int path[N];
int n, m;
int op;

void add(int a, int b) {
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx++;
}
bool dfs(int u, int c) {
    color[u] = c;
    for (int i = h[u]; i != -1; i = ne[i]) {
        int j = e[i];
        if (!color[j]) {
            path[j] = u;
            if (!dfs(j, 3 - c)) return false;
        } else {
            if (color[j] == c) {
                op = j, path[j] = u;
                return false;
            }
        }
    }
    return true;
}

void solve() {
    cin >> n >> m;
    memset(h, -1, sizeof h);
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        add(a, b), add(b, a);
    }
    bool flag = true;

    for (int i = 1; i <= n; i++) {
        if (!color[i]) {
            if (!dfs(i, 1)) {
                flag = false;
                break;
            }
        }
    }
    if (flag) {
        cout << '0' << endl;
        for (int i = 1; i <= n; i++) {
            cout << color[i] - 1 << ' ';
        }
    } else {
        vector<int> ans;
        int now = op;   
        do {
            ans.push_back(now);
            now = path[now];
        } while (now != op);//路径还原

        cout << (int)ans.size() << endl;
        for (int i = 0; i < ans.size(); i++) {
            cout << ans[i] << ' ';
        }
    }
}

signed main() {
    int T = 1;
    // FA;
    while (T--) {
        solve();
    }
}