oj.uz

Submission #877870

# Submission time Handle Problem Language Result Execution time Memory
877870 2023-11-23T19:37:15 Z VMaksimoski008 Stranded Far From Home (BOI22_island) C++14
0 / 100
 75 ms 9584 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

struct Edge {
    int a, b, w;
    bool operator<(Edge &e) {
        return w < e.w;
    } 
};

struct DSU {
    int n;
    vector<int> par, mx;
    vector<ll> total;
    vector<bool> bad;

    DSU(int &_n, vector<int> &_v) {
        n = _n + 1;
        par.resize(n+1);
        mx.resize(n+1);
        total.resize(n+1);
        bad.resize(n+1);
        for(int i=1; i<=n; i++) {
            par[i] = i;
            bad[i] = 0;
            total[i] = mx[i] = _v[i];
        }
    }

    int find(int x) {
        if(x == par[x]) return x;
        if(bad[par[x]]) bad[x] = 1;
        return par[x] = find(par[x]);
    }

    bool uni(int a, int b) {
        a = find(a);
        b = find(b);

        if(a == b) return false;
        if(mx[a] < mx[b]) swap(a, b);
        if(mx[a] > total[b]) bad[b] = 1;
        par[b] = a;
        total[a] += total[b];
        
        return true;
    }

    bool check(int a) {
        find(a);
        return bad[a];
    }
};

int32_t main() {
    setIO();

    int n, m;
    cin >> n >> m;
    vector<int> val(n+1);
    for(int i=1; i<=n; i++) cin >> val[i];

    vector<Edge> edges(m);
    for(Edge &e : edges) {
        cin >> e.a >> e.b;
        e.w = max(val[e.a], val[e.b]);
    }

    DSU dsu(n, val);
    sort(all(edges));
    for(Edge &e : edges) dsu.uni(e.a, e.b);

    for(int i=1; i<=n; i++)
        cout << !dsu.check(i);
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 66 ms 9396 KB Output is correct
4 Incorrect 52 ms 8524 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 75 ms 9380 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 66 ms 9584 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -