oj.uz

Submission #723091

# Submission time Handle Problem Language Result Execution time Memory
723091 2023-04-13T08:33:17 Z dxz05 Stranded Far From Home (BOI22_island) C++17
0 / 100
 183 ms 15728 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define MP make_pair
const int N = 200500;

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int s[N];
bool can[N];

struct dsu{
    vector<int> p;
    vector<long long> sum;

    dsu(){};

    dsu(int n){
        p.resize(n);
        iota(all(p), 0);

        sum.resize(n);
        for (int i = 0; i < n; i++) sum[i] = s[i];
    }

    int leader(int x){
        return (x == p[x] ? x : p[x] = leader(p[x]));
    }

    bool unite(int x, int y){
        int px = leader(x);
        int py = leader(y);
        if (px == py) return false;

        if (sum[px] < s[y]) can[x] = false;
        if (sum[py] < s[x]) can[y] = false;

        sum[y] += sum[x];
        p[x] = y;

        return true;
    }
};

vector<int> g[N];
void solve(){
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; i++){
        cin >> s[i];
    }

    while (m--){
        int u, v;
        cin >> u >> v;
        --u, --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    vector<int> perm(n);
    iota(all(perm), 0);

    sort(all(perm), [](int i, int j){
        return s[i] < s[j];
    });

    fill(can, can + n, true);

    dsu d(n);
    for (int i : perm){
        sort(all(g[i]), [](int x, int y){
            return s[x] < s[y];
        });

        for (int j : g[i]){
            d.unite(i, j);
        }
    }

    for (int i = 0; i < n; i++){
        cout << can[i];
    }

}

int main() {
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    solve();

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 4 ms 5076 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 132 ms 15596 KB Output is correct
4 Incorrect 131 ms 15728 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Incorrect 176 ms 15448 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Incorrect 183 ms 15536 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 4 ms 5076 KB Output isn't correct
5 Halted 0 ms 0 KB -