-
Notifications
You must be signed in to change notification settings - Fork 0
/
ECC14D.cpp
129 lines (120 loc) · 3.16 KB
/
ECC14D.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
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
125
126
127
128
/*
* J1K7_7
*
* You can use my contents on a Creative Commons - Attribution 4.0 International - CC BY 4.0 License. XD
* - JASKAMAL KAINTH
*/
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <cstring>
#include <cassert>
#include <list>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <limits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define left(x) (x << 1)
#define right(x) (x << 1) + 1
#define mid(l, r) ((l + r) >> 1)
#define mp make_pair
#define pb push_back
#define all(a) a.begin(),a.end()
#define debug(x) {cerr <<#x<<" = " <<x<<"\n"; }
#define debug2(x, y) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<"\n";}
#define debug3(x, y, z) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<"\n";}
#define debug4(x, y, z, w) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<", "<<#w << " = " <<w <<"\n";}
#define ss second
#define ff first
#define m0(x) memset(x,0,sizeof(x))
const int mod=1e9+7;
template<class T> inline T gcd(T a,T b){ll t;while(b){a=a%b;t=a;a=b;b=t;}return a;}
template<class T> inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T, typename S> T expo(T b, S e, const T &m){if(e <= 1)return e == 0?1: b;\
return (e&1) == 0?expo((b*b)%m, e>>1, m): (b*expo((b*b)%m, e>>1, m))%m;}
template<typename T> T modinv(T a) { return expo(a, mod-2, mod); }
inline int nextint(){ int x; scanf("%d",&x); return x; }
inline ll nextll(){ ll x; scanf("%lld",&x); return x; }
const ll mx_ll = numeric_limits<ll> :: max();
const int mx_int = numeric_limits<int> :: max();
const long double PI = (long double)(3.1415926535897932384626433832795);
const int maxn = 1e6+7;
int rankN[maxn];
int parentN[maxn];
int n; // number of nodes
inline void make_set()
{
for(int i = 0; i < n; i++)
parentN[i] = rankN[i] = i;
}
inline int find_set(int u)
{
if(parentN[u] != u )
parentN[u] = find_set(parentN[u]);
return parentN[u];
}
inline void union_set(int u,int v)
{
int pu = find_set(u);
int pv = find_set(v);
if(pu == pv)
return ;
if(rankN[pu] > rankN[pv])
{
parentN[pv] = pu;
}
else
{
parentN[pu] = pv;
if(rankN[pu] == rankN[pv])
rankN[pv]++;
}
}
vector<int> inp(maxn);
priority_queue<int,vector<int> >pq[maxn];
int main()
{
ios_base::sync_with_stdio(false) ; cin.tie(0);
int m; cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> inp[i];
make_set();
for(int i = 0; i < m; i++)
{
int u ,v; cin >> u >> v;
u--; v--;
union_set(u,v);
}
for(int i = 0; i < n; i++)
{
pq[find_set(i)].push(inp[i]);
}
for(int i = 0; i < n; i++)
{
cout << pq[find_set(i)].top() << " ";
pq[find_set(i)].pop();
}
return 0;
}