Summer Holiday(tarjan+缩点

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+10;
struct node{
    int to,nxt;
}d[N*2];int head[N*2],tot=0;
void add(int a,int b){
    d[++tot]={b,head[a]};head[a]=tot;
}
int low[N],dfn[N],Stack[N],belong[N];
int Index,top,scc,num[N];
bool instack[N];
int val[N],val2[N];
void tarjan(int u){
    int v;
    low[u]=dfn[u]=++Index;
    Stack[top++]=u;
    instack[u]=true;
    for(int i=head[u];i;i=d[i].nxt){
        v=d[i].to;
        if(!dfn[v]){
            tarjan(v);
            if(low[u]>low[v]){
                low[u]=low[v];
            }
        }else if(instack[v]&&low[u]>dfn[v]){
            low[u]=low[v];
        }
    }
    if(low[u]==dfn[u]){
        scc++;
        int MIN=1e9;
        do{
            v=Stack[--top];
            instack[v]=false;
            belong[v]=scc;num[scc]++;
            MIN=min(MIN,val[v]);
        }while(v!=u);
        val2[scc]=MIN;
    }
    return ;
}
void solve(int n){
    memset(dfn,0,sizeof dfn);
    memset(instack,false,sizeof instack);
    memset(num,0,sizeof num);
    Index=scc=top=0;
    for(int i=1;i<=n;i++){
        if(!dfn[i]) tarjan(i);
    }
}
void init(){
    tot=0;memset(head,0,sizeof head);
}
int n,m,in[N];
int main(){
    while(scanf("%d%d",&n,&m)!=EOF){
        init();
        memset(in,0,sizeof in);
        for(int i=1;i<=n;i++) scanf("%d",&val[i]);
        for(int i=1;i<=m;i++){
            int a,b;scanf("%d%d",&a,&b);
            add(a,b);
        }
        solve(n);
        for(int i=1;i<=n;i++){
            for(int j=head[i];j;j=d[j].nxt){
                int to=d[j].to;
                int bx=belong[i],by=belong[to];
                if(bx!=by) in[by]++;
            }
        }
        int ans=0,cnt=0;
        for(int i=1;i<=scc;i++){
//                cout<<val2[i]<<endl;
            if(in[i]==0) ans+=val2[i],cnt++;
        }
        cout<<cnt<<" ";
        cout<<ans<<endl;
    }
}