oj.uz

답안 #674184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674184 2022-12-23T11:54:19 Z stanislavpolyn Stranded Far From Home (BOI22_island) C++17
35 / 100
 1000 ms 42252 KB 
#include <bits/stdc++.h>

#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define all(x) (x).begin(), (x).end()
#define pw(x) (1LL << (x))
#define sz(x) (int)(x).size()

using namespace std;

mt19937_64 rng(228);

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template <typename T>
bool umn(T& a, T b) { return a > b ? a = b, 1 : 0; }
template <typename T>
bool umx(T& a, T b) { return a < b ? a = b, 1 : 0; }

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;

const int N = 2e5 + 5;

int n, m;
int a[N];
ve<int> g[N];
ve<pii> u;

ve<int> v[N];
int link[N];
ll sum[N];

int root(int x) {
    if (link[x] == x) return x;
    else return root(link[x]);
}

void uni(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b) {
        return;
    }
    if (sz(v[a]) > sz(v[b])) swap(a, b);

    sum[b] += sum[a];
    link[a] = b;
    fe (x, v[a]) v[b].pb(x);
}

bool bad[N];

bool brute(int v) {
    ll sum = 0;
    set<pii> q;
    ve<bool> vis(n + 1);
    sum = a[v];
    vis[v] = 1;

//    cout << "GO " << v << " " << sum << "\n";
    fe (to, g[v]) {
        q.insert({a[to], to});
        vis[to] = 1;
    }
    while (sz(q)) {
//        cout << "FROM " << v << "\n";

        int v = q.begin()->se;
        q.erase(q.begin());

//        cout << "GO " << v << " " << a[v] << "\n";

        if (a[v] > sum) {
            return 0;
        }

        sum += a[v];
        fe (to, g[v]) {
            if (!vis[to]) {
                vis[to] = 1;
                q.insert({a[to], to});
            }
        }
    }
    return 1;
}

int rnd(int l, int r) {
    return rng() % (r - l + 1) + l;
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(0);
    cin.tie(0);
#endif

    cin >> n >> m;

    fr (i, 1, n) {
        cin >> a[i];
//        a[i] = rnd(1, 20);
//        cout << a[i] << " ";
        u.pb({a[i], i});
    }
//    cout << "\n";

//    assert(m == n - 1);
    fr (i, 1, m) {
        int a, b;
        cin >> a >> b;
//        a = i;
//        b = i + 1;


        g[a].pb(b);
        g[b].pb(a);
    }

    sort(all(u));

//    fe (x, a) {
//        cout << x.fi << " " << x.se << "\n";
//    }

    fr (i, 1, n) {
        link[i] = i;
        sum[i] = a[i];
        v[i] = {i};
    }

    fr (i, 0, sz(u) - 1) {
        int ptr = i;
        ve<int> ver;
        while (ptr < sz(u) && u[ptr].fi == u[i].fi) {
            ver.pb(u[ptr].se);
            fe (to, g[u[ptr].se]) {
                if (a[to] <= u[i].fi) {
                    uni(u[ptr].se, to);
                }
            }
            ptr++;
        }

//        cout << "added <= " << u[ptr - 1].fi << "\n";
//        cout << "other >= " << u[ptr].fi << "\n\n";

        if (ptr < sz(u)) {
            int ptr2 = ptr;
            while (ptr2 < sz(u) && u[ptr2].fi == u[ptr].fi) {
                fe (to, g[u[ptr2].se]) {
                    if (a[to] < u[ptr].fi) {
                        int v = root(to);
                        if (sum[v] < u[ptr].fi) {
                            fe (cur, ::v[v]) {
                                bad[cur] = 1;
                            }
                        }
                    }
                }
                ptr2++;
            }
        }

        i = ptr - 1;
    }

    fr (i, 1, n) {
        cout << !bad[i];
    }
    cout << "\n";

//    fr (i, 1, n) {
//        cout << brute(i);
//    }
//    cout << "\n";

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 6 ms 9940 KB Output is correct
6 Correct 7 ms 9940 KB Output is correct
7 Correct 6 ms 9904 KB Output is correct
8 Correct 6 ms 9812 KB Output is correct
9 Correct 8 ms 9940 KB Output is correct
10 Correct 6 ms 10000 KB Output is correct
11 Correct 6 ms 9940 KB Output is correct
12 Correct 7 ms 9940 KB Output is correct
13 Correct 6 ms 9940 KB Output is correct
14 Correct 6 ms 9940 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 156 ms 29128 KB Output is correct
4 Correct 150 ms 30588 KB Output is correct
5 Correct 187 ms 37264 KB Output is correct
6 Correct 196 ms 38320 KB Output is correct
7 Correct 214 ms 38196 KB Output is correct
8 Correct 148 ms 34112 KB Output is correct
9 Correct 170 ms 42252 KB Output is correct
10 Correct 164 ms 33440 KB Output is correct
11 Correct 140 ms 33892 KB Output is correct
12 Correct 168 ms 33344 KB Output is correct
13 Correct 134 ms 33184 KB Output is correct
14 Correct 141 ms 33248 KB Output is correct
15 Correct 139 ms 33368 KB Output is correct
16 Correct 92 ms 32456 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 235 ms 35324 KB Output is correct
3 Correct 249 ms 39836 KB Output is correct
4 Correct 156 ms 34536 KB Output is correct
5 Correct 131 ms 33076 KB Output is correct
6 Correct 237 ms 39848 KB Output is correct
7 Correct 193 ms 33424 KB Output is correct
8 Correct 156 ms 33412 KB Output is correct
9 Correct 93 ms 32512 KB Output is correct
10 Correct 148 ms 33216 KB Output is correct
11 Correct 170 ms 32880 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 231 ms 31024 KB Output is correct
3 Correct 239 ms 36036 KB Output is correct
4 Correct 242 ms 37260 KB Output is correct
5 Correct 203 ms 36820 KB Output is correct
6 Correct 169 ms 34936 KB Output is correct
7 Correct 131 ms 35776 KB Output is correct
8 Execution timed out 1081 ms 31556 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 6 ms 9940 KB Output is correct
6 Correct 7 ms 9940 KB Output is correct
7 Correct 6 ms 9904 KB Output is correct
8 Correct 6 ms 9812 KB Output is correct
9 Correct 8 ms 9940 KB Output is correct
10 Correct 6 ms 10000 KB Output is correct
11 Correct 6 ms 9940 KB Output is correct
12 Correct 7 ms 9940 KB Output is correct
13 Correct 6 ms 9940 KB Output is correct
14 Correct 6 ms 9940 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 156 ms 29128 KB Output is correct
18 Correct 150 ms 30588 KB Output is correct
19 Correct 187 ms 37264 KB Output is correct
20 Correct 196 ms 38320 KB Output is correct
21 Correct 214 ms 38196 KB Output is correct
22 Correct 148 ms 34112 KB Output is correct
23 Correct 170 ms 42252 KB Output is correct
24 Correct 164 ms 33440 KB Output is correct
25 Correct 140 ms 33892 KB Output is correct
26 Correct 168 ms 33344 KB Output is correct
27 Correct 134 ms 33184 KB Output is correct
28 Correct 141 ms 33248 KB Output is correct
29 Correct 139 ms 33368 KB Output is correct
30 Correct 92 ms 32456 KB Output is correct
31 Correct 5 ms 9684 KB Output is correct
32 Correct 235 ms 35324 KB Output is correct
33 Correct 249 ms 39836 KB Output is correct
34 Correct 156 ms 34536 KB Output is correct
35 Correct 131 ms 33076 KB Output is correct
36 Correct 237 ms 39848 KB Output is correct
37 Correct 193 ms 33424 KB Output is correct
38 Correct 156 ms 33412 KB Output is correct
39 Correct 93 ms 32512 KB Output is correct
40 Correct 148 ms 33216 KB Output is correct
41 Correct 170 ms 32880 KB Output is correct
42 Correct 4 ms 9684 KB Output is correct
43 Correct 231 ms 31024 KB Output is correct
44 Correct 239 ms 36036 KB Output is correct
45 Correct 242 ms 37260 KB Output is correct
46 Correct 203 ms 36820 KB Output is correct
47 Correct 169 ms 34936 KB Output is correct
48 Correct 131 ms 35776 KB Output is correct
49 Execution timed out 1081 ms 31556 KB Time limit exceeded
50 Halted 0 ms 0 KB -