oj.uz

Submission #599476

# Submission time Handle Problem Language Result Execution time Memory
599476 2022-07-19T14:29:40 Z SlavicG Stranded Far From Home (BOI22_island) C++17
0 / 100
 554 ms 66024 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

const int N = 2e5 + 10;
ll cnt[N], p[N], c[N], mx[N];
set<int> s[N];
vector<int> adj[N];
int get(int a) {return p[a] = (p[a] == a ? a : get(p[a]));}

int uni(int a, int b, int vb) {
    a = get(a), b = get(b);
    bool swapped = false;
    if(s[a].size() > s[b].size()) {
        swap(a, b);
        swapped = true;
    }
    if(!swapped) {
        if(cnt[a] >= vb) {
            for(auto x: s[a]) s[b].insert(x);
        }
    } else if(cnt[b] >= vb){
        for(auto x: s[a]) s[b].insert(x);
    }

    p[a] = b;
    cnt[b] += cnt[a];
    return b;
}
int main() {
    int n, m; cin >> n >> m;
    vector<pair<int, int>> paiu;
    for(int i = 0; i < n; ++i) {
        cin >> c[i];
        paiu.push_back({c[i], i});
    }
    for(int i = 0; i < n; ++i) {
        p[i] = i;
        cnt[i] = c[i];
        s[i].insert(i);
    }
    sort(paiu.begin(), paiu.end());
    vector<bool> vis(n, false);
    for(int i = 0; i < m; ++i) {
        int u, v; cin >> u >> v; --u, --v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    int root = -1;
    for(int i = 0; i < n; ++i) {
        int u = paiu[i].second;
        for(int v: adj[u]) {
            if(!vis[v]) continue;
            if(get(u) != get(v)) root = uni(v, u, c[u]);
        }
        vis[u] = true;
    }

    if(n == 1) {
        cout << "1\n";
    } else {
        vector<int> ans(n, 0);
        for(auto x: s[root]) ans[x] = 1;
        for(auto x: ans) cout << x;
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14384 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Incorrect 11 ms 14676 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14392 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 478 ms 46032 KB Output is correct
4 Incorrect 316 ms 48340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Incorrect 554 ms 66024 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14292 KB Output is correct
2 Incorrect 521 ms 52208 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14384 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Incorrect 11 ms 14676 KB Output isn't correct
5 Halted 0 ms 0 KB -