Codeforces Round #244 (Div. 2)

Problem C - Checkposts

SCC

#include <bits/stdc++.h>
#define maxn 100010
#define INF (int)(1e9)
#define MOD ((int)1e9+7)
typedef long long ll;
using namespace std;
int a[maxn];
//vector<int> G[maxn];
struct node {
    int to, w, next;
};
node edge[maxn << 2];
int head[maxn];
multiset<int> Set;
int pre[maxn], lowlink[maxn], sccno[maxn], dfs_clock, scc_cnt;
int Stack[maxn];
int s_m;
//stack<int> S;
ll res, num, cnt;
void dfs(int u) {
    pre[u] = lowlink[u] = ++dfs_clock;
    //S.push(u);
    Stack[++s_m] = u;
    //for (int i = 0; i < G[u].size(); ++ i) {
    for (int k = head[u]; k != -1; k = edge[k].next) {
        int v = edge[k].to;
        if (!pre[v]) {
            dfs(v);
            lowlink[u] = min(lowlink[u], lowlink[v]);
        }
        else if (!sccno[v]) {
            lowlink[u] = min(lowlink[u], pre[v]);
        }
    }
    if (lowlink[u] == pre[u]) {
        scc_cnt++;
        int Min = INF;
        Set.clear();
        //cnt = 0;
        for (;;) {
            //int x = S.top();
            //S.pop();
            int x = Stack[s_m];
            s_m --;
            //cout << a[x] << " ";
            Min = min(Min, a[x]);
            sccno[x] = scc_cnt;
            Set.insert(a[x]);
            //cnt ++;
            if (x == u) break;
        }
        //cout << endl;
        res += Min;
        if (Set.count(Min)) {
            num *= Set.count(Min);
            num %= MOD;
        }
    }
}
void find_scc(int n) {
    dfs_clock = scc_cnt = 0;
    memset(sccno, 0, sizeof(sccno));
    memset(pre, 0, sizeof(pre));
    for (int i = 0; i < n; ++ i) {
        if (!pre[i]) dfs(i);
    }
}
int main() {
    #ifdef LOCAL
        freopen("data.in", "r", stdin);
    #endif // LOCAL
    int n, m;
    while (cin >> n) {
        res = 0, num = 1;
        s_m = 0;
        memset(head, -1, sizeof(head));
        /*for (int i = 0; i < n; ++ i) {
            G[i].clear();
        }*/
        for (int i = 0; i < n; ++ i) {
            cin >> a[i];
        }
        cin >> m;
        for (int i = 0; i < m; ++ i)  {
            int u, v;
            cin >> u >> v;
            --u, --v;
            edge[i].to = v;
            edge[i].next = head[u];
            head[u] = i;
        }
        find_scc(n);
        cout << res << " " << num << endl;
    }
}