# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578216 | kingfran1907 | Stranded Far From Home (BOI22_island) | C++14 | 3 ms | 468 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 = 2010;
int n, m;
int niz[maxn];
vector< int > graph[maxn];
bool bio[maxn];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", niz+i);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
graph[a].push_back(b);
graph[b].push_back(a);
}
for (int i = 1; i <= n; i++) {
int sum = niz[i];
set< pair<int, int> > s;
memset(bio, false, sizeof bio);
bio[i] = true;
for (int tren : graph[i]) {
s.insert({niz[tren], tren});
}
while (!s.empty()) {
int x = s.begin()->second;
int val = s.begin()->first;
if (val > sum) break;
s.erase(s.begin());
bio[x] = true;
sum += val;
for (int tren : graph[x])
if (!bio[tren]) s.insert({niz[tren], tren});
}
printf("%d", s.empty());
}
return 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... |