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>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9+7
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e4+7;
const int nax = 2e5+5;
typedef complex<int> Point;
#define X real()
#define Y imag()
vii s;
vi adj[nax];
ll mn = INF,res = 0, vl[nax];
ll ans[nax];
bool vis[nax], cur[nax];
vi cdfs;
void dfs(int u){
cdfs.pb(u);
cur[u] = 1;
res += vl[u];
for(auto x : adj[u]){
if(vis[x]){
if(ans[x] == 1) mn = min(mn,vl[x]);
continue;
}
if(cur[x]) continue;
dfs(x);
}
}
int main(){
optimise;
int n,m;
cin >>n >> m;
for (int i = 0; i < n; ++i)
{
int val;
cin >> val;
vl[i] = val;
s.pb({val,i});
}
for (int i = 0; i < m; ++i)
{
int a,b;
cin >> a >> b;
a--,b--;
adj[a].pb(b);
adj[b].pb(a);
}
sort(s.begin(), s.end(), greater<ii>());
vis[s[0].se] = 1;
ans[s[0].se] = 1;
for (int i = 1; i < n; ++i)
{
mn = INF,res = 0;
dfs(s[i].se);
if(res >= mn) ans[s[i].se] = 1;
vis[s[i].se] = 1;
for(auto x: cdfs)
cur[x] = 0;
cdfs.clear();
}
for (int i = 0; i < n; ++i)
{
cout << ans[i];
}
}
# | 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... |