結果

問題 No.2505 matriX cOnstRuction
ユーザー suisensuisen
提出日時 2023-02-13 16:59:19
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 5,172 bytes
コンパイル時間 1,212 ms
コンパイル使用メモリ 97,500 KB
実行使用メモリ 266,020 KB
最終ジャッジ日時 2024-09-15 16:36:30
合計ジャッジ時間 7,335 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 1 WA * 63
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

int floor_pow2(int n) {
    int 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 = 30;

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

void solve(int n, int m, const std::vector<int>& r, const std::vector<int>& c, const std::vector<std::vector<int>>& 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 = [&](int Y, int Z, int W) {
        const int 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) {
        int Y = a[0][0] ^ a[i][0];
        if (r[i]) {
            add_cost(Y, 0, 1);
            add_cost(Y, r[i], 1);
            add_cost(Y, 2 * floor_pow2(r[i]) - 1, inf);
        } else {
            add_cost(Y, 0, inf);
        }
    }
    for (int j = 0; j < m; ++j) {
        int Y = a[0][j];
        if (c[j]) {
            add_cost(Y, 0, 1);
            add_cost(Y, c[j], 1);
            add_cost(Y, 2 * floor_pow2(c[j]) - 1, inf);
        } else {
            add_cost(Y, 0, inf);
        }
    }

    std::pair<long long, int> min_cost{ inf, 0 };
    std::vector<std::tuple<Node::pointer, int, int>> st{ { root, 0, 1 << 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 int 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);
    std::vector<std::tuple<char, int, int>> ops;
    for (int i = 0; i < n; ++i) {
        int s = X ^ a[0][0] ^ a[i][0];
        if (s == 0) {
            continue;
        } else if (s <= r[i]) {
            println('r', i + 1, s);
        } else {
            int p = floor_pow2(r[i]);
            println('r', i + 1, p);
            println('r', i + 1, s ^ p);
        }
    }
    for (int j = 0; j < m; ++j) {
        int t = X ^ a[0][j];
        if (t == 0) {
            continue;
        } else if (t <= c[j]) {
            println('c', j + 1, t);
        } else {
            int p = floor_pow2(c[j]);
            println('c', j + 1, p);
            println('c', j + 1, t ^ p);
        }
    }
}

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<int> r(n), c(m);
        for (auto& e : r) std::cin >> e;
        for (auto& e : c) std::cin >> e;

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

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

    return 0;
}
0