제출 #1209665

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1209665		Malix	Stranded Far From Home (BOI22_island)	C++20	0 / 100	228 ms	27312 KiB

island

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))

ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int n,m;
vii a;
vi p,s;
vector<ll> b;

int parent(int x){
    if(p[x]==x)return x;
    return p[x]=parent(p[x]);
}

void merge(int x,int y){
    x=parent(x);
    y=parent(y);
    if(x==y)return;
    if(s[x]<s[y])swap(x,y);
    s[x]+=s[y];
    b[x]+=b[y];
    p[y]=x;
}

int main() {   
// ios::sync_with_stdio(0);
// cin.tie(0);
    cin>>n>>m;
    a.resize(n);
    b.resize(n);
    REP(i,0,n)cin>>b[i];
    REP(i,0,m){
        int x,y;cin>>x>>y;
        x--;y--;
        a[x].PB(y);
        a[y].PB(x);
    }
    p.resize(n);s.resize(n,1);
    REP(i,0,n)p[i]=i;
    set<pair<ll,int>> c;
    REP(i,0,n)c.insert({b[i],i});
    string ans(n,'1');
    REP(i,0,n){
        int y=c.begin()->S;
        c.erase(c.begin());
        vector<pi> arr;
        for(auto u:a[y])if(b[u]<=b[y]){
            arr.PB({b[u],u});
            merge(u,y);
        }
        b[y]=b[parent(y)];
        for(auto u:arr){
            if(c.count({u})){
                c.erase(c.find({u}));
                c.insert({b[parent(y)],u.S});
            }
            b[u.S]=b[y];
        }
        if(arr.size()==0)ans[y]='0';
        if(s[parent(y)]==n)ans[y]='1';
    }
    REP(i,0,n)if(ans[parent(i)]=='0')ans[i]='0';
    cout<<ans;
}

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