# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098843 | not_amir | Stranded Far From Home (BOI22_island) | C++14 | 87 ms | 19216 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;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<pii> village(n);
vector<vector<int>> G(n + 1);
vector<int> parent(n + 1), vsize(n + 1);
for(int i = 1; i <= n; i++) {
int a;
cin >> a;
village[i - 1] = {a, i};
parent[i] = i;
}
sort(village.begin(), village.end());
for(int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<bool> visited(n + 1);
for(auto [vs, v] : village) {
vsize[v] = vs;
visited[v] = true;
for(int u : G[v]) {
if(!visited[u]) continue;
while(u != parent[u])
u = parent[u] = parent[parent[u]];
if(u == v)
continue;
vsize[v] += vsize[u];
if(vsize[u] >= vs)
parent[u] = v;
}
}
int v = village.back().second;
while(v != parent[v])
v = parent[v] = parent[parent[v]];
for(int i = 1; i <= n; i++) {
int u = i;
while(u != parent[u])
u = parent[u] = parent[parent[u]];
if(u == v)
cout << '1';
else
cout << '0';
}
}
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... |