-
Notifications
You must be signed in to change notification settings - Fork 0
/
dsu.cpp
63 lines (63 loc) · 1.15 KB
/
dsu.cpp
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
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long LL;
const int lim = 1e3 + 1;
const int maxn = 1e3;
const int maxk = 1e3;
const int LL mod = 1e9 + 7;
vector<LL> E(lim);
vector<int> parent(lim);
int ancestor(int a)
{
if (a != parent[a])
parent[a] = ancestor(parent[a]);
return parent[a];
}
void merge(int a, int b)
{
a = ancestor(a);
b = ancestor(b);
if (a != b)
parent[a] = b;
}
int main()
{
int n;
scanf("%d", &n);
assert(1 <= n and n <= maxn);
for (int i = 1; i <= n; i++)
scanf("%lld", &E[i]);
for (int i = 1; i <= n; i++)
parent[i] = i;
int k;
scanf("%d", &k);
assert(1 <= k and k <= maxk);
for (int i = 1; i <= k; i++)
{
int city1, city2;
scanf("%d%d", &city1, &city2);
merge(city1, city2);
}
for (int i = 1; i <= n; i++)
parent[i] = ancestor(i);
map<int, multiset<int> > mp;
for (int i = 1; i <= n; i++)
mp[parent[i]].insert(E[i]);
LL ans = 1;
for (auto foo: mp)
{
LL cnt = 1;
int low = *(foo.second.begin());
foo.second.erase(foo.second.begin());
for (auto bar: foo.second)
{
if (bar != low)
break;
cnt++;
}
ans = (ans * cnt) % mod;
}
printf("%lld\n", ans);
return 0;
}