제출 #1081883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1081883		Tymond	Stranded Far From Home (BOI22_island)	C++17	100 / 100	190 ms	38448 KiB

island

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct Info{
    vi winners;
    ll s;
    Info(vi xd = {}, ll x = 0LL){
        winners = xd;
        s = x;
    }
};

const int MAXN = 2e5 + 7;
vi g[MAXN];
ll a[MAXN];
Info tab[MAXN];
int rep[MAXN];
int was[MAXN];
int n, m;

int Find(int v){
    if(rep[v] == v){
        return v;
    }
    return rep[v] = Find(rep[v]);
}

void Union(int u, int v, int f){
    if(!f){
        tab[u].winners.clear();
        tab[v].s = (ll)tab[v].s + tab[u].s;

        rep[u] = v;
        return;
    }

    if(sz(tab[u].winners) < sz(tab[v].winners)){
        swap(u, v);
    }

    for(auto ele : tab[v].winners){
        tab[u].winners.pb(ele);
    }
    tab[u].s = (ll)tab[u].s + tab[v].s;
    rep[v] = u;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> m;
    vector<pii> vec;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        vec.pb({(int)a[i], i});
        rep[i] = i;
        was[i] = 0;
        tab[i] = Info({i}, (ll)a[i]);
    }

    for(int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }

    sort(all(vec));
    for(int i = 0; i < n; i++){
        int v = vec[i].se;
       // int c = vec[i].fi;

        was[v] = 1;
        for(auto u : g[v]){
            if(was[u]){
                int r = Find(u);
                int nasz = Find(v);
                if(r == nasz){
                    continue;
                }

                if(tab[r].s >= a[v]){
                    Union(r, nasz, 1);
                }else{
                    Union(r, nasz, 0);
                }
            }
        }
    }

    int r = Find(1);
    vi ans(n + 1, 0);
    for(auto ele : tab[r].winners){
        ans[ele] = 1;
    }

    for(int i = 1; i <= n; i++){
        cout << ans[i];
    }
    cout << '\n';

    return 0;
}

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