P2194 HXY烧情侣

思路:纯纯阅读理解题,它这个去电影院不是沿着道路走的,也就是不需要按照图的顺序访问,是直接挑选一个$scc$去访问
那问题就很好解决了,对于一个强联通块,必须访问他们的最少的点权的点,设为$num[x]$.
方案数目就是$\prod num[x]$
对了,它是方案数取模,其他不取模,注意

/*
I don't wanna be left behind,Distance was a friend of mine.
Catching breath in a web of lies,I've spent most of my life.
Catching my breath letting it go turning my cheek for the sake of this show
Now that you know this is my life I won't be told what's supposed to be right
Catch my breath no one can hold me back I ain't got time for that.
*/
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+5;
const int INF = 1e9+7;
typedef long long ll;
typedef pair<int,int> pii;
#define all(a) (a).begin(), (a).end()
#define pb(a) push_back(a)
vector<int> G[maxn];
int dfn[maxn],low[maxn],dfs_clock=0;int scc[maxn],scc_cnt;
stack<int> S;
int mn[maxn],num[maxn];int a[maxn];
void dfs(int u){
	low[u] = dfn[u] = ++dfs_clock;
	S.push(u);
	for(auto v : G[u]){
		if(!dfn[v]){
			dfs(v);
			low[u] = min(low[u],low[v]);
		}
		else if(!scc[v]) low[u] = min(low[u],dfn[v]);//不是cross_edge而是back_edge的情况更新
	}
	if(low[u]==dfn[u]){
		scc_cnt++;
		while(true){
			int x=S.top();S.pop();
			if(a[x]<mn[scc_cnt]){
				mn[scc_cnt] = a[x];
				num[scc_cnt] = 1;
			}
			else if(a[x]==mn[scc_cnt]) num[scc_cnt]++;
			scc[x]=scc_cnt;
			if(x==u) break;
		}
	}
}
int main(){
    ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];mn[i] = INF;
	}
	int m;cin>>m;
	for(int i=1;i<=m;i++){
		int u,v;cin>>u>>v;
		G[u].pb(v);
	}
	for(int i=1;i<=n;i++){
		if(!dfn[i]) dfs(i);
	}
	ll ans = 1,sum=0;ll mod = INF;
	for(int i=1;i<=scc_cnt;i++) ans = ans*num[i]%mod,sum = (sum+mn[i]);
	cout<<sum<<" "<<ans;
}