/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
const int N=2e5+5;
int ans[N],arr[N],n,m;
vector<int>adj[N];
struct DSU{
vector<int>P,sz,sum;
vector<vector<int>>ok;
void init(int n){
P.resize(n+5);
ok.resize(n+5);
sum.resize(n+5);
for(int i=0;i<n+5;i++)sum[i]=arr[i],P[i]=i,ok[i].push_back(i);
}
int find(int node){
if(P[node]==node)return node;
return P[node]=find(P[node]);
}
bool unite(int a,int b){
int p1=find(a);
int p2=find(b);
if(p1==p2){
return 0;
}
if(sum[p2]<arr[a]){
for(auto i:ok[p2])ans[i]=0;
ok[p2].clear();
}
for(auto i:ok[p1])ok[p2].push_back(i);
ok[p1].clear();
P[p1]=p2;
sum[p2]+=sum[p1];
return 1;
}
}d;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
fast
cin>>n>>m;
vector<pair<int,int>>v;
for(int i=1;i<=n;i++){
cin>>arr[i];
v.push_back({arr[i],i});
}
while(m--){
int u,v;cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
d.init(n);
sort(all(v));
for(int i=0;i<n;i++){
int node=v[i].second,x=v[i].first;
for(auto ch:adj[node]){
if(arr[ch]>arr[node] || (arr[ch]==arr[node] && ch>node))continue;
d.unite(node,ch);
}
}
for(auto i:d.ok[d.find(1)])ans[i]=1;
for(int i=1;i<=n;i++)cout<<ans[i];
cout<<endl;
return 0;
}
Compilation message
island.cpp: In function 'int main()':
island.cpp:94:30: warning: unused variable 'x' [-Wunused-variable]
94 | int node=v[i].second,x=v[i].first;
| ^
island.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
76 | freopen("input.in", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
island.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
77 | freopen("output.out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
5208 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
5464 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
5212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
5236 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
5208 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
