# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635768 | null_awe | Stranded Far From Home (BOI22_island) | C++14 | 495 ms | 39264 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.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
vector<vector<int>> w;
vector<ll> vals;
vector<int> r, p;
int find(int a) { return a == p[a] ? a : p[a] = find(p[a]); }
void link(int a, int b) {
a = find(a), b = find(b);
if (a == b) return;
if (r[a] < r[b]) swap(a, b);
if (r[a] == r[b]) ++r[a];
p[b] = a;
}
int main() {
int n, m; cin >> n >> m;
vector<int> arr(n); for (int i = 0; i < n; ++i) cin >> arr[i];
set<int> nums; for (int num : arr) nums.insert(num);
vector<int> copy(nums.begin(), nums.end());
vector<vector<pii>> edges(copy.size());
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b; --a, --b;
edges[lower_bound(copy.begin(), copy.end(), max(arr[a], arr[b])) - copy.begin()].push_back({a, b});
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |