# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589856 | 2022-07-05T11:07:54 Z | 1zaid1 | Stranded Far From Home (BOI22_island) | C++17 | 4 ms | 868 KB |
#include <bits/stdc++.h> using namespace std; #define endl '\n' const int M = 4e3+1; vector<int> node[M]; int p[M]; bool bfs(int s) { bitset<100005> vis; int sum = p[s]; queue<int> q; vis[s] = 1; q.push(s); while (!q.empty()) { int t = q.front(); 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 n, 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Incorrect | 2 ms | 468 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 412 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Runtime error | 4 ms | 868 KB | Execution killed with signal 11 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Runtime error | 4 ms | 648 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Runtime error | 4 ms | 724 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Incorrect | 2 ms | 468 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |