oj.uz

Submission #599485

# Submission time Handle Problem Language Result Execution time Memory
599485 2022-07-19T14:34:20 Z SlavicG Stranded Far From Home (BOI22_island) C++17
10 / 100
 1000 ms 371576 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

const int N = 2e5 + 10;
ll cnt[N], p[N], c[N];
set<ll> s[N];
vector<ll> adj[N];

ll get(ll a) {return p[a] = (p[a] == a ? a : get(p[a]));}

void uni(ll a, ll b, ll vb) {
    a = get(a), b = get(b);
    if(a == b) return;
    bool swapped = false;
    if((ll)s[a].size() > (ll)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];
}
int main() {
    int n, m; cin >> n >> m;
    vector<pair<ll, ll>> 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);
    }

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

    vector<int> ans(n, 0);
    for(auto x: s[get(paiu[n - 1].second)]) ans[x] = 1;
    for(auto x: ans) cout << x;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 59 ms 30788 KB Output is correct
5 Correct 22 ms 18460 KB Output is correct
6 Correct 78 ms 40288 KB Output is correct
7 Correct 52 ms 30156 KB Output is correct
8 Correct 45 ms 27480 KB Output is correct
9 Correct 137 ms 61524 KB Output is correct
10 Correct 11 ms 15172 KB Output is correct
11 Correct 11 ms 15160 KB Output is correct
12 Correct 12 ms 14932 KB Output is correct
13 Correct 283 ms 105388 KB Output is correct
14 Correct 13 ms 16212 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Execution timed out 1104 ms 371576 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 691 ms 141936 KB Output is correct
3 Correct 699 ms 145700 KB Output is correct
4 Execution timed out 1119 ms 342280 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Execution timed out 1114 ms 336884 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 59 ms 30788 KB Output is correct
5 Correct 22 ms 18460 KB Output is correct
6 Correct 78 ms 40288 KB Output is correct
7 Correct 52 ms 30156 KB Output is correct
8 Correct 45 ms 27480 KB Output is correct
9 Correct 137 ms 61524 KB Output is correct
10 Correct 11 ms 15172 KB Output is correct
11 Correct 11 ms 15160 KB Output is correct
12 Correct 12 ms 14932 KB Output is correct
13 Correct 283 ms 105388 KB Output is correct
14 Correct 13 ms 16212 KB Output is correct
15 Correct 8 ms 14292 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Execution timed out 1104 ms 371576 KB Time limit exceeded
18 Halted 0 ms 0 KB -