HihoCoder 1121 二分图一•二分图判定

DFS标记一下，防止多个连通图的出现就好

#include <bits/stdc++.h>

using namespace std;

#define se second
#define fi first
#define ll long long
#define pb push_back
#define CLR(a,b) memset(a,(b),sizeof(a))
const int MAXN = (int)1e4+10;

vector<int> E[MAXN];
int vis[MAXN];
int n, m;
bool flag;
void dfs(int u, int c) {
    if(flag)
        return;
    vis[u] = c;
    for(int i = 0; i < (int)E[u].size(); ++i) {
        int v = E[u][i];
        if(vis[v]==0) {
            dfs(v, -c);
        } else {
            if(vis[v] == vis[u]) {
                flag = true;
                return;
            }
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while(T--) {
        for(int i = 1; i <= n; ++i) E[i].clear();
        CLR(vis, 0);
        cin >> n >> m;
        for(int i = 1; i <= m; ++i) {
            int u, v;
            cin >> u >> v;
            E[u].pb(v); E[v].pb(u);
        }
        flag = false;
        for(int i = 1; i <= n; ++i) {
            if(vis[i]==0 && !flag)
                dfs(i, 1);
        }
        if(!flag)
            cout << "Correct\n";
        else
            cout << "Wrong\n";

    }
    return 0;
}