Submission #2225689

---

Source Code Expand

#include<iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define MAX_V 50
vector<int> graph[MAX_V];
bool used_v[MAX_V],used_e[MAX_V][MAX_V];
int ord[MAX_V],lowlink[MAX_V];
int k=0;
using namespace std;
void dfs(int v){
    used_v[v] = true;
    ord[v] = lowlink[v] = k++;
    for(int i=0;i<graph[v].size();i++){
        if(!used_v[graph[v][i]]){
            used_e[v][graph[v][i]] = true;
            dfs(graph[v][i]);
            lowlink[v]=min(lowlink[v],lowlink[graph[v][i]]);
        }
        else if(!used_e[graph[v][i]][v]){
            lowlink[v]=min(lowlink[v],ord[graph[v][i]]);
        }
    }
}

int main(){
    int N,M;
    int a,b;
    int ans=0;
    cin >> N >> M;
    for(int i=0;i<M;i++){
        cin >> a >> b;
        graph[a-1].push_back(b-1);
        graph[b-1].push_back(a-1);
    }
    dfs(0);
    for(int i=0;i<N;i++){
        for(int j=0;j<graph[i].size();j++){
            if(ord[i] < lowlink[graph[i][j]]) ans++;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result