Submission #64305979

---

Source Code Expand

#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;

int dfs(int node, vector<bool> &visited, vector<vector<int>>& adj, int parent) {
    visited[node] = true;
    int cycle_count = 0;

    for (int neigh : adj[node]) {
        if (!visited[neigh]) {
            cycle_count += dfs(neigh, visited, adj, node);
        } else if (neigh != parent) {
            cycle_count++;  
        }
    }

    return cycle_count;
}

int main() {
    int n, m; cin>>n>>m;
    vector<vector<int>> adj(n+1);

    for(int i=0;i<m;i++) {
        int u, v; cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    vector<bool> vis(n+1, false);
    int total_cycles = 0;

    for (int i = 0; i <= n; i++) {
        if (!vis[i]) {
            total_cycles += dfs(i, vis, adj, -1);
        }
    }

    cout<<total_cycles / 2<<endl; 
}

Submission Info

Judge Result