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;
#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#define getchar_unlocked getchar
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define psf push_front
#define ppb pop_back
#define ppf pop_front
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(),x.end()
#define lb(x,v) (lower_bound(all(x),v)-x.begin())
#define ub(x,v) (upper_bound(all(x),v)-x.begin())
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> iii;
typedef tuple<int,int,int,int> iiii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
mt19937 rng(time(0));
#define mod 1000000007
inline int add(int a,int b){
int r=a+b;
while(r>=mod)r-=mod;
while(r<0)r+=mod;
return r;
}
inline int mult(int a,int b){
return (int)(((ll)(a*b))%mod);
}
inline int rd(){
int x=0;
char ch=getchar_unlocked();
while(!(ch&16))ch=getchar();//keep reading while current character is whitespace
while(ch&16){//this will break when ‘\n’ or ‘ ‘ is encountered
x=(x<<3)+(x<<1)+(ch&15);
ch=getchar_unlocked();
}
return x;
}
#define maxn 200005
int n,m,s[maxn],p[maxn],rnk[maxn],tot[maxn];
bool good[maxn];
vi ans[maxn];
vii EL;
int fp(int i){
return p[i]==i?i:p[i]=fp(p[i]);
}
int join(int x,int y){
x=fp(x),y=fp(y);
if(rnk[x]<rnk[y])p[x]=y;
else p[y]=x;
if(rnk[x]==rnk[y])++rnk[x];
return p[x];
}
int main(){
sf("%d%d",&n,&m);
for(int i=0;i<n;++i){
sf("%d",&s[i]);
ans[i].pb(i);
p[i]=i,rnk[i]=0;
tot[i]=s[i];
}
for(int i=0;i<m;++i){
int a,b;
sf("%d%d",&a,&b);
--a,--b;
if(s[a]>s[b])swap(a,b);
EL.pb({a,b});
}
sort(all(EL),[&](ii &a,ii &b){
return max(s[a.fi],s[a.se])<max(s[b.fi],s[b.se]);
});
for(auto[u,v]:EL){
int pu=fp(u),pv=fp(v);
if(pu==pv)continue;
int p=join(pu,pv);
if(tot[pu]>=s[v]){
vi tmp;
swap(ans[pu],tmp);
if(sz(tmp)<sz(ans[pv]))swap(tmp,ans[pv]);
for(int i:ans[pv])tmp.pb(i);
swap(tmp,ans[p]);
}
else{
if(pu==p)swap(ans[pu],ans[pv]);
}
tot[p]=tot[pu]+tot[pv];
}
int p=fp(0);
for(int i:ans[p])good[i]=true;
for(int i=0;i<n;++i)pf("%d",good[i]);
pf("\n");
}
Compilation message (stderr)
island.cpp: In function 'int main()':
island.cpp:82:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
82 | sf("%d%d",&n,&m);
| ^
island.cpp:84:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
84 | sf("%d",&s[i]);
| ^
island.cpp:91:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
91 | sf("%d%d",&a,&b);
| ^
# | 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... |