Hint
The critical roads are bridges. Take the part of the program from the lesson that finds bridges and print their number.
Solution (C++)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<vector<int>> graph;
vector<int> tin, low;
int timer = 0, bridgeCount = 0;
void dfs(int v, int parent) {
tin[v] = low[v] = ++timer;
for (int u : graph[v]) {
if (u == parent) continue;
if (tin[u]) low[v] = min(low[v], tin[u]);
else {
dfs(u, v);
low[v] = min(low[v], low[u]);
if (low[u] > tin[v]) bridgeCount++; // v-u is a bridge
}
}
}
int main() {
int n, m;
cin >> n >> m;
graph.resize(n + 1);
tin.assign(n + 1, 0);
low.assign(n + 1, 0);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
graph[u].push_back(v);
graph[v].push_back(u);
}
dfs(1, 0);
cout << bridgeCount << endl;
return 0;
}