Submission #599570

#	Time	Username	Problem	Language	Result	Execution time	Memory
599570		alexander707070	Stranded Far From Home (BOI22_island)	C++14	25 / 100	227 ms	57488 KiB

island

#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;

int n,m,a,b,curr;
long long s[MAXN];
vector<int> v[MAXN];
int p[MAXN],dsu[MAXN];
long long sz[MAXN];
vector<int> can[MAXN];
bool in[MAXN],notok[MAXN];

bool cmp(int x,int y){
    return s[x]<s[y];
}

int root(int x){
    if(dsu[x]==x)return dsu[x];
    dsu[x]=root(dsu[x]);
    return dsu[x];
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>s[i];
        p[i]=i; dsu[i]=i;
        sz[i]=s[i]; can[i]={i};
    }
    sort(p+1,p+n+1,cmp);

    for(int i=1;i<=m;i++){
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }

    for(int i=1;i<=n;i++){
        curr=p[i];
        for(int f:v[curr]){
            if(!in[f])continue;
            if(sz[root(f)]<s[curr]){
                for(int k:can[root(f)])notok[k]=true;
                can[root(f)].clear();
            }
            if(can[root(f)].size()<can[root(curr)].size()){
                for(int k:can[root(f)])can[root(curr)].push_back(k);
                sz[root(curr)]+=sz[root(f)];
                dsu[root(f)]=root(curr);
            }else{
                for(int k:can[root(curr)])can[root(f)].push_back(k);
                sz[root(f)]+=sz[root(curr)];
                dsu[root(curr)]=root(f);
            }
        }
        in[curr]=true;
    }

    for(int i=1;i<=n;i++){
        if(notok[i])cout<<0;
        else cout<<1;
    }
    cout<<"\n";
 
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 0 / 30
• Subtask 5: 0 / 35