1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
| #include <iostream>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cstdio>
#define MAXN 100100
#define INF 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
struct Edge;
struct Node
{
Edge *edge;
int dfn, low, color;
bool flag;
int val;
Node()
{
flag = false;
dfn = low = color = 0;
edge = NULL;
}
}node[MAXN];
struct Edge
{
Node *from, *to;
Edge *next;
Edge(Node *from, Node *to):from(from),to(to),next(from->edge) {}
};
int cnt = 0;
stack<Node *> s;
void Tarjan(Node *x)
{
static int num = 0;
x->low = x->dfn = ++num;
x->flag = true;
s.push(x);
for (Edge *e = x->edge; e; e = e->next)
{
if (e->to->dfn==0)
{
Tarjan(e->to);
x->low = min(x->low, e->to->low);
}else if (e->to->flag)
x->low = min(x->low, e->to->dfn);
}
if (x->dfn==x->low)
{
x->flag = false;
x->color = ++cnt;
while ( !s.empty() && s.top()!=x)
{
Node *v = s.top();
v->color = cnt;
v->flag= false;
s.pop();
}
if (!s.empty())
s.pop();
}
}
int minCost[MAXN];
long long way[MAXN];
int main()
{
int n,m;
scanf("%d",&n);
for (int i = 1; i<=n; i++)
scanf("%d",&node[i].val);
scanf("%d",&m);
for (int i = 1; i<=m; i++)
{
int x,y;
scanf("%d%d",&x,&y);
node[x].edge = new Edge(&node[x],&node[y]);
}
for (int i = 1; i<=n; i++)
if (node[i].dfn==0)
Tarjan(&node[i]);
memset(minCost,INF,sizeof(minCost));
for (int i = 1; i<=n; i++)
{
if (node[i].val < minCost[ node[i].color ])
{
minCost[ node[i].color ] = node[i].val;
way[ node[i].color ] = 1;
}else if (node[i].val == minCost[ node[i].color ])
{
way[ node[i].color ] ++ ;
}
}
long long ans[2];
ans[0] = 0;
ans[1] = 1;
for (int i = 1; i<=cnt; i++)
{
ans[0] += minCost[i];
ans[1] *= way[i];
ans[1] %= MOD;
}
cout << ans[0] << " " << ans[1] << endl;
}
|