洛谷P2194 【HXY烧情侣】

首先请允许我吐槽一下这个题面

这个题面透露出血腥与暴力，电影院里还藏汽油

所以情侣们，要是想看电影就在家里看吧

毕竟出来容易被烧

在家里看虽然观影效果不如在电影院里

但是，

起码咱生命安全啥的有保障啊

题面

思路：

tarjan

注意方案数是乘法原理

#include <cstdio>
#include <iostream>
using namespace std;
const int N = 1e6+;
const int md = 1e9+;
int n, head[N << ], cnt,  w[N], m, dfn[N], low[N], tot, top, stac[N], ans, minn, sum = , geshu;
bool vis[N];
struct node {
    int nxt, to;
}e[N << ];
int read() {
    int s = , w = ;
    char ch = getchar();
    while(!isdigit(ch)) {if(ch == '-') w = -; ch = getchar();}
    while(isdigit(ch)) {s = s *  + ch - ''; ch = getchar();}
    return s * w;
}
void add(int x, int y) {
    e[++cnt].nxt = head[x];
    e[cnt].to = y;
    head[x] = cnt;
}
void tarjan(int u) {
    dfn[u] = low[u] = ++tot, stac[++top] = u, vis[u] = ;
    for(int i = head[u]; i; i = e[i].nxt) {
        int v = e[i].to;
        if(!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]);
        else if(vis[v]) low[u] = min(low[u], dfn[v]);
    }
    if(dfn[u] == low[u]) {
        geshu = ,     minn = 0x3f3f3f3f;
        while(stac[top] != u) {
            vis[stac[top]] = ;
            if(w[stac[top]] < minn) minn = w[stac[top]], geshu = ;
            if(w[stac[top--]] == minn) geshu++;
        }
        top--, vis[u] = ;
        if(w[u] < minn) minn = w[u], geshu = ;
        else if(w[u] == minn) geshu++;
        ans += minn;
        sum = (sum * geshu) % md;
    }
}
int main() {
    n = read();
    for(int i = ; i <= n; i++) w[i] = read();
    m = read();
    for(int i = , x, y; i <= m; i++) {
        x = read(), y = read();
        add(x, y);
    }
    for(int i = ; i <= n; i++)
        if(!dfn[i]) tarjan(i);
    printf("%d %d\n", ans, sum);
    return ;
}

谢谢收看， 祝身体健康！