# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590278 | 1zaid1 | Stranded Far From Home (BOI22_island) | C++17 | 1076 ms | 22396 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 endl '\n'
const int M = 4e5+1;
#define int long long
vector<int> node[M];
bitset<200005> vis;
int p[M], n, d[M];
bool bfs(int s) {
for (int i = 1; i <= n; i++) d[i] = vis[i] = 0;
int sum = p[s];
priority_queue<int, vector<int>, greater<int>> q;
vis[s] = 1;
q.push(s);
while (!q.empty()) {
int t = q.top(); q.pop();
for (int i:node[t]) {
if (!vis[i]) {
if (p[i] > sum) return 0;
sum += p[i];
vis[i] = 1;
q.push(i);
}
}
}
return true;
}
signed main() {
cin.tie(0)->sync_with_stdio(0);
int m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> p[i];
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
node[a].push_back(b);
node[b].push_back(a);
}
for (int i = 1; i <= n; i++) sort(node[i].begin(), node[i].end(),[](int a, int b) {return p[a] < p[b];});
for (int i = 1; i <= n; i++) cout << bfs(i); cout << endl;
return 0;
}
/*
4 4
2 2 4 3
1 2
1 3
2 3
3 4
4 3
4 2 2 1
1 2
3 2
4 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... |