結果

問題 No.1896 Arrays and XOR Procedure 2
コンテスト
ユーザー sten_san
提出日時 2022-04-09 11:13:05
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 14 ms / 2,000 ms
コード長 3,546 bytes
コンパイル時間 2,363 ms
コンパイル使用メモリ 199,432 KB
最終ジャッジ日時 2025-01-28 16:56:39
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int n; cin >> n;
    auto a = vec<int>(uns, n);
    auto b = vec<int>(uns, n);
    for (auto &e : a) cin >> e;
    for (auto &e : b) cin >> e;

    auto ans = vec<array<int, 3>>(uns, 0);

    auto op1 = [&](int p, int q) {
        ans.push_back({ 1, p + 1, q + 1 });
        a[p] ^= b[q];
    };

    auto op2 = [&](int p, int q) {
        ans.push_back({ 2, p + 1, q + 1 });
        b[q] ^= a[p];
    };

    auto msb = [](int x) {
        int c = 0;
        while (0 < x) {
            x >>= 1; ++c;
        }
        return c - 1;
    };

    int x = 0, y = 0;
    int s = 0, t = 0;

    for (int i = 0; i < n; ++i) {
        auto m = msb(a[i]);
        if (x <= m) {
            s = i; x = m;
        }
    }

    for (int i = 0; i < n; ++i) {
        auto m = msb(b[i]);
        if (y <= m) {
            t = i; y = m;
        }
    }

    if (x < y) {
        op1(s, t);
    }
    if (y < x) {
        op2(s, t);
    }
    chmax(x, y); chmax(y, x);

    for (int i = 0; i < n; ++i) {
        if (msb(b[i]) != y) {
            op2(s, i);
        }
    }

    for (int i = 0; i < n; ++i) {
        if (msb(a[i]) == x) {
            op1(i, t);
        }
    }

    cout << size(ans) << endl;
    for (auto [t, p, q] : ans) {
        cout << t << " " << p << " " << q << endl;
    }
}
0