#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
const int MAX_N = 2e5 + 9;
vector<int> adj[MAX_N], weights(MAX_N);
bool visited[MAX_N];
priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
void add_children(int u){
for(int i: adj[u]){
if(visited[i]) continue;
pq.push(make_pair(weights[i], i));
}
}
int main() {
int n, m, right = 0;
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> weights[i];
right += weights[i];
}
for(int i = 0; i < m; i++){
int x, y;
cin >> x >> y;
adj[y].push_back(x);
adj[x].push_back(y);
}
for(int i = 1; i <= n; i++){
int sum = weights[i];
visited[i] = 1;
add_children(i);
while(pq.top().ff <= sum && !pq.empty()){
visited[pq.top().ss] = 1;
sum += pq.top().ff;
pq.pop();
add_children(pq.top().ss);
}
cout << (sum == right);
pq = priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>();
fill(visited, visited + MAX_N, false);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
5972 KB |
Output is correct |
2 |
Correct |
3 ms |
5972 KB |
Output is correct |
3 |
Runtime error |
8 ms |
11556 KB |
Execution killed with signal 11 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
5972 KB |
Output is correct |
2 |
Runtime error |
8 ms |
11428 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
8 ms |
11476 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
9 ms |
11540 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
5972 KB |
Output is correct |
2 |
Correct |
3 ms |
5972 KB |
Output is correct |
3 |
Runtime error |
8 ms |
11556 KB |
Execution killed with signal 11 |
4 |
Halted |
0 ms |
0 KB |
- |