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;
vector<vector<int>>v;
vector<int>a,res,dp;
vector<bool>vis;
bool cmp(int c,int b){return a[c]<a[b];}
bool dfs(int x,int y){
vis[x]=true;
if(dp[y]>=dp[x]) dp[y]+=dp[x];
else return false;
for(int z:v[x]){
//cout<<z<<endl;
if(!vis[z]) return dfs(z,y);
}
return true;
}
int main(){
int n,m;cin>>n>>m;
a.resize(n);res.assign(n,0);
v.resize(n);dp.resize(n);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<m;i++){
int a,b;cin>>a>>b;--a,--b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=0;i<n;i++) sort(v[i].begin(),v[i].end(),cmp);
for(int i=0;i<n;i++){
vis.assign(n,false);
for(int i=0;i<n;i++) dp[i]=a[i];
bool b=true;
for(int z:v[i])
if(!vis[z]) if(!dfs(z,i)){b=false;break;}
cout<<(b?1:0);
}
}
# | 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... |