# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
691237 | bdl | Stranded Far From Home (BOI22_island) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <array>
#include <iostream>
#include <vector>
using namespace std;
const int N = 2e5;
int e[N];
int find(int i) {
return e[i] < 0 ? i : e[i] = find(e[i]);
}
void link(int i, int j) {
i = find(i), j = find(j);
if (e[i] > e[j])
swap(i, j);
e[i] += e[j], e[j] = i;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
static int s[N];
for (int i = 0; i < n; i++)
cin >> s[i];