#752681 (C++17) No.1900 Don't be Powers of 2

提出ソース

結果

問題	No.1900 Don't be Powers of 2
ユーザー	haruki_K
提出日時	2022-04-08 22:24:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	131 ms / 2,000 ms
コード長	11,232 bytes
コンパイル時間	2,843 ms
コンパイル使用メモリ	232,908 KB
実行使用メモリ	75,716 KB
最終ジャッジ日時	2024-05-06 07:56:29
合計ジャッジ時間	4,457 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	7 ms 5,376 KB
testcase_04	AC	8 ms 5,376 KB
testcase_05	AC	8 ms 5,376 KB
testcase_06	AC	8 ms 5,376 KB
testcase_07	AC	7 ms 5,376 KB
testcase_08	AC	5 ms 5,376 KB
testcase_09	AC	4 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	6 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	5 ms 5,376 KB
testcase_15	AC	1 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	7 ms 5,376 KB
testcase_18	AC	5 ms 5,376 KB
testcase_19	AC	7 ms 5,376 KB
testcase_20	AC	5 ms 5,376 KB
testcase_21	AC	5 ms 5,376 KB
testcase_22	AC	5 ms 5,376 KB
testcase_23	AC	3 ms 5,376 KB
testcase_24	AC	7 ms 5,376 KB
testcase_25	AC	7 ms 5,376 KB
testcase_26	AC	129 ms 75,716 KB
testcase_27	AC	25 ms 15,368 KB
testcase_28	AC	8 ms 5,376 KB
testcase_29	AC	8 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB
testcase_31	AC	1 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	119 ms 75,144 KB
testcase_34	AC	121 ms 75,144 KB
testcase_35	AC	131 ms 75,656 KB
testcase_36	AC	108 ms 67,464 KB
testcase_37	AC	9 ms 5,376 KB
testcase_38	AC	31 ms 24,700 KB
testcase_39	AC	13 ms 11,128 KB
testcase_40	AC	8 ms 5,376 KB
testcase_41	AC	9 ms 5,376 KB
testcase_42	AC	1 ms 5,376 KB
testcase_43	AC	1 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#define if_LOCAL(x, y) (x)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#define if_LOCAL(x, y) (y)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
    repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
    return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
    repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
    return false;
}
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}
template <class V> auto prefix_sum(V const& a) {
    vector<typename V::value_type> s;
    s.reserve(a.size() + 1);
    s.push_back(0);
    for (auto const& x : a) s.emplace_back(s.back() + x);
    return s;
}
template <class V> auto suffix_sum(V const& a) {
    vector<typename V::value_type> s(a.size() + 1);
    int pos = a.size();
    for (auto it = a.rbegin(); it != a.rend(); ++it, --pos) {
        s[pos-1] = *it + s[pos];
    }
    return s;
}
// <<<
// >>> union find

struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int32_t> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n, -1) { }
    void clear() {
        rep (i, n) par[i] = -1;
        sz = n;
    }
    int root(int x) {
        assert(0 <= x); assert(x < n);
        return par[x] < 0 ? x : par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        sz--;
        if (par[x] < par[y]) swap(x, y);
        par[y] += par[x];
        par[x] = y;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return -par[root(x)]; }
    int size() const { return sz; }
    vector<vector<int32_t>> groups() {
        vector<vector<int32_t>> g(n);
        rep (i, n) if (par[i] < 0) g[i].reserve(-par[i]);
        rep (i, n) g[root(i)].push_back(i);
        vector<vector<int32_t>> grp; grp.reserve(size());
        rep (i, n) if (g[i].size()) grp.emplace_back(move(g[i]));
        return grp;
    }
};

// <<<
// >>> Dinic
template <class Flow>
struct Dinic {
    static constexpr Flow INF = numeric_limits<Flow>::max();
    static constexpr Flow EPS = 1e-10; //

    struct Edge {
        int32_t to, rev, id;
        Flow cap;
        Edge(int to, int rev, int id, Flow cap)
            : to(to), rev(rev), id(id), cap(cap) {}
    };
    vector<vector<Edge>> g;
    vector<pair<int32_t, int32_t>> es;
    vector<int32_t> level, iter;
    int V, E, s, t;

    Dinic(int V = 0) : g(V), V(V), E(0), s(-1), t(-1) {}
    void add_edge(int from, int to, Flow cap) {
        assert(0 <= from); assert(from < V);
        assert(0 <= to); assert(to < V);
        assert(cap >= 0);
        es.emplace_back(from, g[from].size());
        g[from].emplace_back(to, g[to].size(), E, cap);
        g[to].emplace_back(from, g[from].size()-1, E, 0);
        E++;
    }

    struct edge_t {
        int32_t from, to;
        Flow flow, cap;
    };
    Edge& internal_edge(int id) {
        assert(0 <= id); assert(id < (int)es.size());
        int from, idx; tie(from, idx) = es[id];
        return g[from][idx];
    }
    edge_t edge(int id) const {
        assert(0 <= id); assert(id < (int)es.size());
        int32_t from, idx; tie(from, idx) = es[id];
        auto const& e = g[from][idx];
        auto const& r = g[e.to][e.rev];
        return { from, e.to, r.cap, e.cap+r.cap };
    }
    vector<edge_t> edges() const {
        vector<edge_t> ret(E);
        rep (id, E) ret[id] = edge(id);
        return ret;
    }

    bool bfs() {
        level.assign(V, -1);
        queue<int> q;
        level[s] = 0;
        q.push(s);
        while (q.size() && level[t] < 0) {
            int x = q.front(); q.pop();
            for (auto const& e : g[x]) {
                if (e.cap > EPS && level[e.to] < 0) {
                    level[e.to] = level[x] + 1;
                    q.push(e.to);
                }
            }
        }
        return level[t] >= 0;
    }

    Flow dfs(int x, Flow f = INF) {
        if (x == t) return f;
        Flow res = 0;
        for (auto &i = iter[x]; i < int(g[x].size()); ++i) {
            auto &e = g[x][i];
            if (e.cap > EPS && level[x] < level[e.to]) {
                Flow d = dfs(e.to, min(f, e.cap));
                e.cap -= d;
                g[e.to][e.rev].cap += d;
                res += d;
                f -= d;
                if (f == 0) break;
            }
        }
        return res;
    }

    Flow max_flow(int s, int t) {
        assert(0 <= s); assert(s < V);
        assert(0 <= t); assert(t < V);
        this-> s = s; this->t = t;
        Flow flow = 0;
        while (bfs()) {
            iter.assign(V, 0);
            for (Flow f = 0; (f = dfs(s)); flow += f) {}
        }
        return flow;
    }

#ifdef LOCAL
    friend string to_s(Dinic d) {
        string ret = "\n";
        ret += "V = " + to_s(d.V) + ", E = " + to_s(d.E) + "\n";
        ret += "s = " + to_s(d.s) + ", t = " + to_s(d.t) + "\n";
        for (auto const& p : d.es) {
            auto const& e = d.g[p.first][p.second];
            auto const& r = d.g[e.to][e.rev];
            ret += to_s(e.id) + " : ";
            ret += to_s(p.first) + "->" + to_s(e.to) + " : ";
            ret += to_s(r.cap) + "/" + to_s(e.cap+r.cap) + "\n";
        }
        return ret;
    }
#endif

};
// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> a(n); cin >> a;

    vector<pair<int, int>> es;
    UnionFind uf(2*n);
    rep (j, n) rep (i, j) {
        int x = a[i]^a[j];
        if (x > 0 and (1 << __lg(x)) == x) {
            es.eb(i, j);
            uf.unite(i, n+j);
            uf.unite(j, n+i);
        }
    }

    rep (i, n) assert(not uf.same(i, n+i));

    vector<int> c(n, -1);
    rep (i, n) {
        if (not uf.same(0, i) and not uf.same(n, i)) {
            uf.unite(0, i);
            uf.unite(n, n+i);
        }
        c[i] = uf.same(n, i);
    }
    dump(c);

    Dinic<int> g(n+2);
    const int S = n, T = n+1;
    rep (i, n) {
        if (c[i] == 0) {
            g.add_edge(S, i, 1);
        } else {
            g.add_edge(i, T, 1);
        }
    }
    for (auto [i, j] : es) {
        if (c[i] == 1) swap(i, j);
        dump(i, j, a[i], a[j]);
        assert(c[i] == 0 and c[j] == 1);
        g.add_edge(i, j, 1);
    }

    cout << n-g.max_flow(S, T) << '\n';

    dump(g);

}

yukicoder

結果

テストケース

ソースコード