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 N=200'010;
int s[N];
vector<int> g[N];
int main () {
cin.tie(0)->sync_with_stdio(0);
int n, m;
cin >> n >> m;
for(int i = 0;i<n;i++)cin >> s[i];
for(int i = 0;i<m;i++) {
int a, b;
cin >> a >> b;
a--,b--;
g[a].push_back(b);
g[b].push_back(a);
}
string res="";
for(int i = 0;i<n;i++) {
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
vector<bool> vis(n);
long long sum=s[i];
pq.push({0,i});
vis[i]=1;
bool check=true;
while(pq.size()) {
auto at=pq.top();
pq.pop();
if(at.first<=sum) {
sum+=at.first;
}
else {
check=false;
break;
}
for(int to:g[at.second]) {
if(!vis[to]){
pq.push({s[to],to});
vis[to]=1;
}
}
}
cout<<check;
}
}
# | 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... |