POJ 1144 Network 图论 求割点模板

这道题目是个简单的割点模板题目。就直接贴代码了。
考虑一下输入就行，那个比较麻烦。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std ;
const int maxn = 110, maxm = 10010 ;
int e, n, m, be[maxn], nxt[maxm], to[maxm], pre[maxn], dfs_clock, low[maxn] ;
bool iscut[maxn] ;
bool Read ( int &x ) {
    bool f = 0 ; char c = getchar() ; x = 0 ;
    while ( !isdigit(c) ) {
        if ( c == '-' ) f = 1 ;
        if ( c == EOF || c == '\n' ) return false ;
        c = getchar() ;
    }
    while ( isdigit(c) ) {
        x = 10 * x + c - '0' ;
        c = getchar() ; 
        if ( c == '\n' ) return false ;
    }
    if ( f ) x = -x ;
    return true ;
}
void add ( int u, int v ) {
    to[++e] = v ;
    nxt[e] = be[u] ;
    be[u] = e ;
}
int dfs ( int u, int fa ) {
    int lowu = pre[u] = ++ dfs_clock ;
    int i, j, k ;
    int son = 0 ;
    for ( i = be[u] ; i ; i = nxt[i] ) {
        int v = to[i] ;
        if ( !pre[v] ) {
            ++ son ;
            int lowv = dfs ( v, u ) ;
            lowu = min ( lowu, lowv ) ;
            if ( lowv >= pre[u] ) iscut[u] = 1 ;
        } else if ( v != fa && lowu >= pre[v] && pre[u] > pre[v] ) lowu = pre[v] ;
    }
    if ( son == 1 && fa < 0 ) iscut[u] = 0 ;
    return low[u] = lowu ;
}
int main () {
    int i, j, k, u, v, t ;
    while (1) {
        Read(n) ; 
        if ( !n ) return 0 ;
        dfs_clock = e = 0 ;
        for ( i = 0 ; i < maxn ; i ++ ) 
            be[i] = pre[i] = iscut[i] = to[i] = low[i] = iscut[i] = 0 ;
        for ( i = maxn ; i < maxm ; i ++ ) 
            to[i] = nxt[i] = 0 ;
        while (1) {
            Read(u) ;
            if ( !u ) break ;
            while ( Read(v) && v ) {
                add ( u, v ) ;
                add ( v, u ) ;
            }
            if ( v ) {
                add ( u, v ) ;
                add ( v, u ) ;
            }
        }
        dfs ( 1, -1 ) ;
        int cnt = 0 ;
        for ( i = 1 ; i <= n ; i ++ ) 
            if ( iscut[i] ) ++ cnt ;
        printf ( "%d\n", cnt ) ;
    }
    return 0 ;
}

上面是链式前向星存图，再附上邻接表。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#define pb push_back
using namespace std ;
const int maxn = 10010 ;
vector <int> g[maxn] ;
int low[maxn], n, m, pre[maxn], dfs_clock ;
bool iscut[maxn] ;
bool Read(int &x) {
    char c = getchar() ; x = 0 ; bool flag = 0 ;
    while(!isdigit(c)) {
        if(c == EOF) return false ;
        if(c == '\n') return false ;
        if(c == '-') flag = 1 ;
        c = getchar() ;
    }
    while(isdigit(c)) {
        x = 10 * x + c - '0' ;
        c = getchar() ;
        if(c == '\n') return false ;
    }
    if(flag) x = -x ;
    return true ;
}
int dfs(int u, int father) {
    int i, j, k ;
    int lowu = pre[u] = ++ dfs_clock ;
    int son = 0 ;
    for(i = 0 ; i < g[u].size() ; i ++) {
        int v = g[u][i] ;
        if(!pre[v]) {
            ++ son ;
            int lowv = dfs(v, u) ;
            lowu = min(lowu, lowv) ;
            if(lowv >= pre[u]) iscut[u] = 1 ;
        } else if(v != father && pre[v] < pre[u]) lowu = min(lowu, pre[v]) ;
    }
    if(son == 1 && father < 0) iscut[u] = 0 ;
    return low[u] = lowu ;
}
int main() {
    int x, y, z, i, j, k ;
    while(1) {
        Read(n) ;
        if(!n) return 0 ;
        dfs_clock = 0 ;
        for(i = 0 ; i < maxn ; i ++) g[i].clear() ;
        memset(pre, 0, sizeof(pre)) ;
        memset(low, -1, sizeof(low)) ;
        memset(iscut, 0, sizeof(iscut)) ;
        while(1) {
            Read(z) ;
            if(z == 0) break ;
            while(Read(x) && x) {
                g[z].pb(x) ;
                g[x].pb(z) ;
            }
            if(x) {
                g[z].pb(x) ;
                g[x].pb(z) ;
            }
            if(!x) break ;
        }
        dfs(1, -1) ;
        int cnt = 0 ;
        for(i = 1 ; i <= n ; i ++)
            if(iscut[i]) ++ cnt ;
        printf("%d\n", cnt) ;
    }
    return 0 ;
}