BZOJ 2730: [HNOI2012]矿场搭建

题目

传送门

题解

用Tarjan跑出割点，然后DFS搜索所有的联通快

计算每一个联通快中的割点数目

分类讨论：

如果没有割点

至少需要建立两个出口

从任意非割点的地方选择两个点建立

如果这个分组只有一个割点

只需要在分组内设立一个出口

可以设立在任意一个非割点的地方

如果有两个及以上个割点，则无需建立，可以直接到达其他联通块

code

#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <iomanip>    
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int maxn = 1e5 + 100;
typedef long long ull;

inline int read() {
    int s = 0, w = 1;
    char ch = getchar();
    while (!isdigit(ch)) { if (ch == '-') w = -1; ch = getchar(); }
    while (isdigit(ch)) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
    return s * w;
}

int T;
int n;
int m;
int x;
int y;
int tim;
int num;
int gro;
int ans1;
ull ans2;
int cnt;
int num_edge;
int head[maxn];
int dfn[maxn];
int low[maxn];
int cut[maxn];
int s[maxn];
int vis[maxn];
struct Edge {
    int next, to;
}edge[maxn];

inline void add(int from, int to) {
    edge[++num_edge].to = to;
    edge[num_edge].next = head[from];
    head[from] = num_edge;
}

void tarjan(int x, int fa) {
    dfn[x] = low[x] = ++tim;
    int son = 0;
    for (int i = head[x]; i; i = edge[i].next) {
        int v = edge[i].to;
        if (!dfn[v]){
            tarjan(v, fa);
            low[x] = min(low[x], low[v]);
            if (low[v] >= dfn[x] && x != fa) {
                cut[x] = 1;
            }
            if (x == fa) son++;
        }
        else low[x] = min(low[x], dfn[v]);
    }
    if (son > 1 && x == fa) cut[x] = 1;
}

void dfs(int u) {
    vis[u] = gro;
    num++;
    for (int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].to;
        if (cut[v] && vis[v] != gro) {
            ++cnt;
            vis[v] = gro;
        }
        if (!vis[v]) dfs(v);
    }
}

int main() {
    freopen("input.in","r",stdin);
     freopen("output.out","w",stdout);
    T = 0;
    while (1) {
        ++T;
        n = 0;
        m = read();
        if (!m) break;
        num_edge = 0; gro = 0; tim = 0;
        memset(head, 0, sizeof(head));
        memset(dfn, 0, sizeof(dfn));
        memset(low, 0, sizeof(low));
        memset(edge, 0, sizeof(edge));
        memset(cut, 0, sizeof(cut));
        memset(vis, 0, sizeof(vis));
        ans1 = 0; ans2 = 1;
        for (int i = 1; i <= m; ++i) {
            x = read(), y = read();
            n = max(n, x);
            n = max(n, y);
            add(x, y);
            add(y, x);
        } 
        for (int i = 1; i <= n; ++i) {
            if (!dfn[i]) tarjan(i, i);
        }
        for (int i = 1; i <= n; ++i) {
            if (!vis[i] && !cut[i]) {
                ++gro;
                cnt = num = 0;
                dfs(i);
                if (cnt == 0) {
                    ans1 += 2;
                    ans2 *= (long long)((num - 1) *(num) / 2);
                }
                else if (cnt == 1) {
                    ans1 += 1;
                    ans2 *= (long long)num;
                }
                else if (cnt >= 2) continue;
            }
        }
        printf("Case %d: %d %lld\n", T, ans1, ans2);
    }
    // system("PAUSE");
    return 0;
}