結果

問題 No.2505 matriX cOnstRuction
ユーザー suisensuisen
提出日時 2023-02-14 20:26:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
(最新)
J_ERR  
(最初)
実行時間 -
コード長 4,599 bytes
コンパイル時間 1,251 ms
コンパイル使用メモリ 94,140 KB
実行使用メモリ 134,516 KB
最終ジャッジ日時 2024-09-15 18:41:50
合計ジャッジ時間 5,436 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <array>
#include <cassert>
#include <iostream>
#include <limits>
#include <tuple>
#include <vector>

long long floor_pow2(long long n) {
    long long x = 1;
    while ((x << 1) <= n) x <<= 1;
    return x;
}

void println() {
    std::cout << '\n';
}
template <typename Head, typename ...Tails>
void println(Head&& head, Tails &&...tails) {
    std::cout << std::forward<Head>(head);
    if constexpr (sizeof...(Tails)) {
        std::cout << ' ';
    }
    println(std::forward<Tails>(tails)...);
}

template <typename Derived>
class Object {
    static inline std::vector<Derived> pool{};
    static constexpr int null_ptr = -1;
    struct Pointer {
        constexpr Pointer(): Pointer(null_ptr) {}
        constexpr Pointer(int ptr) : ptr(ptr) {}
        Derived& operator*() const { return pool[ptr]; }
        Derived* operator->() const { return &pool[ptr]; }
        constexpr operator bool() const { return ptr != null_ptr; }
        explicit constexpr operator int() const { return ptr; }
    private:
        int ptr;
    };
public:
    using pointer = Pointer;
    static constexpr pointer null = Pointer(null_ptr);
    template <typename ...Args>
    static pointer create(Args &&...args) {
        pointer ptr = pool.size();
        pool.emplace_back(std::forward<Args>(args)...);
        return ptr;
    }
};

using Weight = long long;

struct Node: public Object<Node> {
    std::array<pointer, 2> child{ null, null };
    Weight weight = 0;

    static pointer get_or_create(pointer ptr, bool child) {
        if (not ptr->child[child]) {
            ptr->child[child] = create();
        }
        return ptr->child[child];
    }
};

constexpr int L = 60;

constexpr Weight inf = std::numeric_limits<int>::max();

void solve(int n, int m, const std::vector<long long>& r, const std::vector<long long>& c, const std::vector<std::vector<long long>>& a) {
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {
        if (a[0][0] ^ a[0][j] ^ a[i][0] ^ a[i][j]) {
            println(-1);
            return;
        }
    }

    Node::pointer root = Node::create();

    // add f(X) = W * [X ^ Y > Z]
    auto add_cost = [&](long long Y, long long Z, Weight W) {
        const long long YZ = Y ^ Z;
        Node::pointer cur = root;
        for (int bit = L - 1; bit >= 0; --bit) {
            Node::pointer nxt = Node::get_or_create(cur, (YZ >> bit) & 1);
            if (not ((Z >> bit) & 1)) {
                cur->weight += W;
                nxt->weight -= W;
            }
            cur = nxt;
        }
    };
    for (int i = 0; i < n; ++i) {
        long long Y = a[0][0] ^ a[i][0];
        add_cost(Y, 0, 1);
    }
    for (int j = 0; j < m; ++j) {
        long long Y = a[0][j];
        add_cost(Y, 0, 1);
    }

    std::pair<Weight, long long> min_cost{ inf, 0 };
    std::vector<std::tuple<Node::pointer, long long, long long>> st{ { root, 0, 1LL << L } };
    while (st.size()) {
        auto [node, l, r] = st.back();
        st.pop_back();
        if (r - l == 1) {
            min_cost = std::min(min_cost, { node->weight, l });
            continue;
        }
        const long long m = (l + r) >> 1;
        if (Node::pointer lch = node->child[0]) {
            lch->weight += node->weight;
            st.emplace_back(lch, l, m);
        } else {
            min_cost = std::min(min_cost, { node->weight, l });
        }
        if (Node::pointer rch = node->child[1]) {
            rch->weight += node->weight;
            st.emplace_back(rch, m, r);
        } else {
            min_cost = std::min(min_cost, { node->weight, m });
        }
    }
    auto [cost, X] = min_cost;

    if (cost >= inf) {
        println(-1);
        return;
    }

    println(cost);
    for (int i = 0; i < n; ++i) {
        long long s = X ^ a[0][0] ^ a[i][0];
        if (s == 0) {
            continue;
        } else {
            println('r', i + 1, s);
        }
    }
    for (int j = 0; j < m; ++j) {
        long long t = X ^ a[0][j];
        if (t == 0) {
            continue;
        } else {
            println('c', j + 1, t);
        }
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t-- > 0) {
        int n, m;
        std::cin >> n >> m;

        std::vector<long long> r(n), c(m);
        for (auto& e : r) std::cin >> e;
        for (auto& e : c) std::cin >> e;

        std::vector a(n, std::vector<long long>(m));
        for (auto& row : a) for (auto& e : row) {
            std::cin >> e;
        }

        solve(n, m, r, c, a);
    }

    return 0;
}
0