結果

問題 No.2505 matriX cOnstRuction
ユーザー suisen
提出日時 2023-02-14 20:26:54
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,893 bytes
コンパイル時間 1,768 ms
コンパイル使用メモリ 94,844 KB
最終ジャッジ日時 2025-02-10 15:26:01
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 1 WA * 63
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#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)...);
}
using Weight = long long;
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;
        }
    }
    // (l, r, w): add w to x in [l, r)
    std::vector<std::tuple<long long, long long, Weight>> costs;
    // add f(X) = W * [X ^ Y > Z]
    auto add_cost = [&](long long Y, long long Z, Weight W) {
        const long long YZ = Y ^ Z;
        std::vector<std::tuple<long long, long long, Weight>> costs_l, costs_r;
        long long l = 0, r = 1LL << L;
        for (int bit = L - 1; bit >= 0; --bit) {
            long long mid = (l + r) >> 1;
            if ((YZ >> bit) & 1) {
                if (not ((Z >> bit) & 1)) {
                    if (costs_l.size() and std::get<1>(costs_l.back()) == l) {
                        std::get<1>(costs_l.back()) = mid;
                    } else {
                        costs_l.emplace_back(l, mid, W);
                    }
                }
                l = mid;
            } else {
                if (not ((Z >> bit) & 1)) {
                    if (costs_r.size() and std::get<1>(costs_r.back()) == r) {
                        std::get<1>(costs_r.back()) = mid;
                    } else {
                        costs_r.emplace_back(mid, r, W);
                    }
                }
                r = mid;
            }
        }
        std::move(costs_l.begin(), costs_l.end(), std::back_inserter(costs));
        std::move(costs_r.begin(), costs_r.end(), std::back_inserter(costs));
    };
    for (int i = 0; i < n; ++i) {
        long long 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) {
        long long 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::vector<long long> xs { 0, 1LL << L };
    for (auto [l, r, w] : costs) {
        xs.push_back(l);
        xs.push_back(r);
    }
    std::sort(xs.begin(), xs.end());
    xs.erase(std::unique(xs.begin(), xs.end()), xs.end());
    const int k = xs.size();
    std::vector<Weight> imos(k);
    for (auto [l, r, w] : costs) {
        imos[std::lower_bound(xs.begin(), xs.end(), l) - xs.begin()] += w;
        imos[std::lower_bound(xs.begin(), xs.end(), r) - xs.begin()] -= w;
    }
    for (int i = 1; i < k; ++i) {
        imos[i] += imos[i - 1];
    }
    std::pair<Weight, long long> min_cost{ inf, 0 };
    for (int i = 0; i < k - 1; ++i) {
        min_cost = std::min(min_cost, std::make_pair(imos[i], xs[i]));
    }
    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 if (s <= r[i]) {
            println('r', i + 1, s);
        } else {
            long long p = floor_pow2(r[i]);
            println('r', i + 1, p);
            println('r', i + 1, s ^ p);
        }
    }
    for (int j = 0; j < m; ++j) {
        long long t = X ^ a[0][j];
        if (t == 0) {
            continue;
        } else if (t <= c[j]) {
            println('c', j + 1, t);
        } else {
            long long 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<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;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0