#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<int> s;
vector<bool> used;
class Compare{
public:
bool operator () (int a, int b){
return s[a] > s[b];
}
};
priority_queue<int, vector<int>, Compare> b;
int n;
char bfs(int u){
used.assign(n+1, false);
long long cnt = s[u];
used[u] = true;
for(int v: g[u])
b.push(v);
while(!b.empty()){
u = b.top();
b.pop();
if(used[u]) continue;
used[u] = true;
if(s[u] > cnt) return '0';
// cout << u << ' ';
cnt += s[u];
for(int v: g[u])
b.push(v);
}
// cout << cnt << ' ';
return '1';
}
int main(){
int m;
cin >> n >> m;
s.resize(n+1);
g.resize(n+1);
for(int i = 1; i <= n; ++i) cin >> s[i];
for(int i = 0, u, v; i < m; ++i){
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
for(int i = 1; i <= n; ++i) cout << bfs(i);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Incorrect |
334 ms |
384 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Execution timed out |
1073 ms |
12684 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Execution timed out |
1074 ms |
11880 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Execution timed out |
1069 ms |
12272 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Incorrect |
334 ms |
384 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |