# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574132 | eecs | Stranded Far From Home (BOI22_island) | C++17 | 320 ms | 30880 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;
const int maxn = 200010;
int n, m, a[maxn], fa[maxn], sum[maxn];
bool vis[maxn], ans[maxn];
vector<int> G[maxn], Q[maxn];
int find(int x) {
return x == fa[x] ? x : fa[x] = find(fa[x]);
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> m;
vector<array<int, 2>> V;
for (int i = 1; i <= n; i++) {
cin >> a[i], V.push_back({a[i], i});
}
while (m--) {
int u, v;
cin >> u >> v;
G[u].push_back(v), G[v].push_back(u);
}
sort(V.begin(), V.end());
for (int i = 1; i <= n; i++) {
int j = lower_bound(V.begin(), V.end(), array<int, 2>{a[i] + 1, 0}) - V.begin() - 1;
Q[j].push_back(i);
}
iota(fa + 1, fa + n + 1, 1);
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... |