oj.uz

Submission #898818

# Submission time Handle Problem Language Result Execution time Memory
898818 2024-01-05T07:01:12 Z hazzle Keys (IOI21_keys) C++17
37 / 100
 1924 ms 90400 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define all(m) (m).begin(), (m).end()
#define rall(m) (m).rbegin(), (m).rend()
#define vec vector
#define sz(a) (int) (a).size()
#define mpp make_pair
#define mtt make_tuple

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef tuple <int, int, int> tui;

template <typename T>
using prq = priority_queue <T>;

template <typename T>
using pgq = priority_queue <T, vec <T>, greater <T>>;

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

vec <int> find_reachable(vec <int> r, vec <int> u, vec <int> v, vec <int> c){
    int n = sz(r), m = sz(u);
    vec <vec <pii>> g(n);
    int mx_c = 0;
    for (int i = 0; i < m; ++i){
        g[u[i]].push_back({v[i], c[i]});
        g[v[i]].push_back({u[i], c[i]});
        umax(mx_c, c[i]);
    }
    auto calc = [&](int s){
        unordered_map <int, bool> have(n), us(n);
        unordered_map <int, vec <int>> qu(n);
        vec <int> bfs = {s};
        us[s] = 1;
        for (int pt = 0; pt < sz(bfs); ++pt){
            int u = bfs[pt];
            have[r[u]] = 1;
            for (auto &v: qu[r[u]]) if (!us[v]){
                us[v] = 1;
                bfs.push_back(v);
            }
            qu[r[u]].clear();
            for (auto &[v, c]: g[u]) if (!us[v]){
                if (have[c]){
                    us[v] = 1;
                    bfs.push_back(v);
                }
                else{
                    qu[c].push_back(v);
                }
            }
        }
        return sz(bfs);
    };
    if (max(n, m) <= 2000){
        int mn = n + 42;
        vec <int> f(n);
        for (int s = 0; s < n; ++s){
            umin(mn, f[s] = calc(s));
        }
        vec <int> res(n);
        for (int i = 0; i < n; ++i){
            res[i] = (f[i] == mn);
        }
        return res;
    }
    else if (mx_c < 30){
        vec <int> msk(n);
        for (int i = 0; i < n; ++i){
            msk[i] = 1 << r[i];
        }
        auto sup = [&](int x, int y){
            return x == (x | y);
        };
        vec <tui> bfs;
        for (int u = 0; u < n; ++u){
            for (auto &[v, c]: g[u]){
                if (sup(msk[u], 1 << c)){
                    bfs.push_back({u, v, c});
                }
            }
        }
        for (int pt = 0; pt < sz(bfs); ++pt){
            auto [u, v, c] = bfs[pt];
            if (sup(msk[u], 1 << c) && !sup(msk[u], msk[v])){
                msk[u] |= msk[v];
                for (auto &[x, k]: g[u]){
                    if (sup(msk[u], 1 << k)){
                        bfs.push_back({u, x, k});
                    }
                }
            }
        }
        vec <vec <int>> gg(n), dd(n);
        for (int u = 0; u < n; ++u){
            for (auto &[v, c]: g[u]){
                if (sup(msk[u], 1 << c)){
                    gg[u].push_back(v);
                    dd[v].push_back(u);
                }
            }
        }
        vec <bool> us(n);
        vec <int> top;
        auto dfs = [&](auto &&dfs, int u) -> void{
            us[u] = 1;
            for (auto &v: gg[u]){
                if (!us[v]) dfs(dfs, v);
            }
            top.push_back(u);
        };
        for (int i = 0; i < n; ++i){
            if (!us[i]) dfs(dfs, i);
        }
        reverse(all(top));
        fill(all(us), 0);
        vec <int> cmp(n);
        int z = 0;
        auto col = [&](auto &&col, int u) -> void{
            us[u] = 1;
            cmp[u] = z;
            for (auto &v: dd[u]){
                if (!us[v]) col(col, v);
            }
        };
        for (auto &u: top) if (!us[u]){
            col(col, u), ++z;
        }
        vec <int> deg(z);
        for (int u = 0; u < n; ++u){
            for (auto &v: gg[u]){
                if (cmp[u] != cmp[v]){
                    ++deg[cmp[u]];
                }
            }
        }
        vec <int> _f(z, 1e9), f(n, 1e9);
        for (int i = 0; i < n; ++i){
            if (_f[cmp[i]] == 1e9 && !deg[cmp[i]]){
                _f[cmp[i]] = calc(i);
            }
        }
        int mn = 1e9;
        for (int i = 0; i < n; ++i){
            umin(mn, f[i] = _f[cmp[i]]);
        }
        assert(mn != 1e9);
        vec <int> res(n);
        for (int i = 0; i < n; ++i){
            res[i] = (f[i] == mn);
        }
        return res;
    }
    return {};
}

inline int solve(){
    return 0;
}

inline void precalc(){}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 468 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 6 ms 348 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 468 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 6 ms 348 KB Output is correct
27 Correct 179 ms 940 KB Output is correct
28 Correct 184 ms 1108 KB Output is correct
29 Correct 177 ms 860 KB Output is correct
30 Correct 130 ms 648 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 102 ms 608 KB Output is correct
35 Correct 99 ms 600 KB Output is correct
36 Correct 407 ms 820 KB Output is correct
37 Correct 372 ms 808 KB Output is correct
38 Correct 558 ms 880 KB Output is correct
39 Correct 530 ms 880 KB Output is correct
40 Correct 16 ms 604 KB Output is correct
41 Correct 97 ms 632 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 1924 ms 48200 KB Output is correct
11 Incorrect 249 ms 90400 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 468 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 6 ms 348 KB Output is correct
27 Correct 179 ms 940 KB Output is correct
28 Correct 184 ms 1108 KB Output is correct
29 Correct 177 ms 860 KB Output is correct
30 Correct 130 ms 648 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 102 ms 608 KB Output is correct
35 Correct 99 ms 600 KB Output is correct
36 Correct 407 ms 820 KB Output is correct
37 Correct 372 ms 808 KB Output is correct
38 Correct 558 ms 880 KB Output is correct
39 Correct 530 ms 880 KB Output is correct
40 Correct 16 ms 604 KB Output is correct
41 Correct 97 ms 632 KB Output is correct
42 Correct 1924 ms 48200 KB Output is correct
43 Incorrect 249 ms 90400 KB Output isn't correct
44 Halted 0 ms 0 KB -