oj.uz

Submission #748675

# Submission time Handle Problem Language Result Execution time Memory
748675 2023-05-26T17:48:32 Z GrindMachine Stranded Far From Home (BOI22_island) C++17
10 / 100
 1000 ms 25560 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct DSU {
    vector<int> par, rankk, siz;
    vector<ll> val;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        val = vector<ll>(n + 1);
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
    }

    int find(int u) {
        if (u == par[u]) return u;
        else return par[u] = find(par[u]);
    }

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];
        val[u] += val[v];
    }
};

vector<ll> adj[N];

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    vector<pll> edges;
    rep1(i,m){
        ll u,v; cin >> u >> v;
        edges.pb({u,v});
        adj[u].pb(v), adj[v].pb(u);
    }

    vector<pll> order;
    rep1(i,n) order.pb({a[i],i});

    sort(rall(order));

    vector<ll> good(n+5);

    for(auto [val,i] : order){
        DSU dsu(n+5);
        rep1(i,n) dsu.val[i] = a[i];

        for(auto [u,v] : edges){
            if(a[u] <= val and a[v] <= val){
                dsu.merge(u,v);
            }
        }

        if(dsu.siz[dsu.find(i)] == n){
            good[i] = 1;
            conts;
        }

        ll curr_sum = dsu.val[dsu.find(i)];

        rep1(u,n){
            if(dsu.same(u,i)){
                trav(v,adj[u]){
                    if(a[v] > val and curr_sum >= a[v]){
                        good[i] |= good[v];                        
                    }
                }
            }
        }
    }

    rep1(i,n) cout << good[i];
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
10.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 3 ms 5008 KB Output is correct
4 Correct 63 ms 5204 KB Output is correct
5 Correct 61 ms 5256 KB Output is correct
6 Correct 48 ms 5192 KB Output is correct
7 Correct 57 ms 5204 KB Output is correct
8 Correct 40 ms 5204 KB Output is correct
9 Correct 78 ms 5248 KB Output is correct
10 Correct 57 ms 5248 KB Output is correct
11 Correct 57 ms 5244 KB Output is correct
12 Correct 45 ms 5272 KB Output is correct
13 Correct 121 ms 5228 KB Output is correct
14 Correct 69 ms 5160 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Execution timed out 1082 ms 25560 KB Time limit exceeded
4 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 Execution timed out 1074 ms 24416 KB Time limit exceeded
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 Execution timed out 1059 ms 25468 KB Time limit exceeded
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 2 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 63 ms 5204 KB Output is correct
5 Correct 61 ms 5256 KB Output is correct
6 Correct 48 ms 5192 KB Output is correct
7 Correct 57 ms 5204 KB Output is correct
8 Correct 40 ms 5204 KB Output is correct
9 Correct 78 ms 5248 KB Output is correct
10 Correct 57 ms 5248 KB Output is correct
11 Correct 57 ms 5244 KB Output is correct
12 Correct 45 ms 5272 KB Output is correct
13 Correct 121 ms 5228 KB Output is correct
14 Correct 69 ms 5160 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Execution timed out 1082 ms 25560 KB Time limit exceeded
18 Halted 0 ms 0 KB -