Submission #602207

#	Time	Username	Problem	Language	Result	Execution time	Memory
602207		Vanilla	Stranded Far From Home (BOI22_island)	C++17	10 / 100	1092 ms	31556 KiB

island

#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int maxn = 2e5 + 2;
int a[maxn], dsu[maxn];
int64 sum[maxn];
vector <int> ad [maxn];
vector <int> comp [maxn];
int rs [maxn];

int dad (int x) {
    return dsu[x] = (x == dsu[x] ? x: dad(dsu[x]));
}

int main() {
    int n,m;
    cin >> n >> m;
    vector <pair <int, int> > v;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        dsu[i] = i;
        sum[i] = a[i];
        comp[i].push_back(i);
        v.push_back({a[i], i});
    }
    for (int i = 1; i <= m; i++){
        int x,y;
        cin >> x >> y;
        ad[x].push_back(y);
        ad[y].push_back(x);
    }
    sort(v.begin(), v.end());
    for (auto [val, x]: v) {
        for (auto y: ad[x]) {
            if (a[y] > a[x]) continue;
            int p1 = dad(x), p2 = dad(y);
            if (val > sum[p2]) comp[p2].clear();
            if (p1 != p2) {
                if (comp[p1].size() < comp[p2].size()) swap(p1, p2);
                dsu[p2] = p1;
                sum[p1] += sum[p2];
                while (!comp[p2].empty()) {
                    comp[p1].push_back(comp[p2].back());
                    comp[p2].pop_back();
                }
            }
            ad[x].pop_back();
        }
    }
    map <int, int> dd;
    for (int i = 1; i <= n; i++){
        if (!dd.count(dad(i))) {
            dd[i] = 1;
            for (int j: comp[dad(i)]) rs[j] = 1;
        }
    }
    for (int i = 1; i <= n; i++) cout << rs[i] << "";
    return 0;
}

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