# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098879 | razivo | Stranded Far From Home (BOI22_island) | C++14 | 0 ms | 0 KiB |
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 <iostream>
#include <vector>
using namespace std;
int find(int p, vector<int> &dsu) {
if(p==dsu[p]) return p;
int u = find(dsu[p],dsu);
dsu[p]=u;
return u;
}
void un(int a,int b,vector<int> &dsu,vector<int> &ev) {
a=find(a,dsu);
b=find(b,dsu);
dsu[b]=a;
ev[a]+=ev[b];
ev[a] = max(1000000000,ev[a]);
}
int main()
{
int n,m;
cin>>n>>m;
vector<int> v(n),ev(n),dsu(n);
vector<pair<int,int>> s;
for (int i = 0; i < n; ++i) {
int x; cin>>x;
ev[i]=x;
v[i]=x;
s.push_back({x,i});
dsu[i]=i;
}
sort(s.begin(), s.end());
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i) {
int x,y; cin>>x>>y; x--; y--;
g[x].push_back(y);
g[y].push_back(x);
}
for (auto [val,i]:s) {
for(auto j : g[i]) {
if(ev[find(i,dsu)]>=v[j]&&(v[i]<=v[j])) un(i,j,dsu,ev);
}
}
int ma = find(s[n-1].second,dsu);
for (int i = 0; i < n; ++i) {
if(ma==find(i,dsu))cout<<"1";
else cout<<"0";
}
}