Submission #573286

#	Time	Username	Problem	Language	Result	Execution time	Memory
573286		AmirElarbi	Stranded Far From Home (BOI22_island)	C++14	100 / 100	218 ms	40240 KiB

island

#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9+7
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e4+7;
const int nax = 4e5+5;
typedef complex<int> Point;
#define X real()
#define Y imag()
vii s;
vi adj[nax], nds[nax];
ll ans[nax];
ll p[nax], sz[nax];
int find_set(int v) {
    if (v == p[v])
        return v;
    return p[v] = find_set(p[v]);
}

void union_sets(int a, int b) {
    a = find_set(a);
    b = find_set(b);
    if (a != b){
        if(nds[b].size() > nds[a].size()) swap(nds[a],nds[b]);
        for(auto x : nds[b]) nds[a].pb(x);
        p[b] = a;
        sz[a] += sz[b];
    }
}
int main(){
    optimise;
    int n,m;
    cin >>n >> m;
    for (int i = 0; i < n; ++i)
    {
        int val;
        cin >> val;
        sz[i] = val;
        p[i] = i;
        nds[i].pb(i);
        s.pb({val,i});
    }
    for (int i = 0; i < m; ++i)
    {
        int a,b;
        cin >> a >> b;
        a--,b--;
        if(mp(sz[a],a) < mp(sz[b],b)) swap(a,b);
        adj[a].pb(b);
    }
    sort(s.begin(), s.end());
    for (int i = 0; i < n; ++i)
    {
        int u = find_set(s[i].se);
        for(auto x : adj[u]){
            x = find_set(x);
            if(sz[u] > sz[x]) nds[x].clear();
        }
        for(auto x : adj[u]) union_sets(x,u);  
    }
    for(auto x: nds[find_set(0)]) ans[x] = 1;
    for (int i = 0; i < n; ++i)
    {
        cout << ans[i];
    }
}

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