#742360 (C++17) No.1589 Bit Vector

提出ソース

結果

問題	No.1589 Bit Vector
ユーザー	minato
提出日時	2022-02-27 06:17:14
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	3 ms / 2,000 ms
コード長	8,571 bytes
コンパイル時間	2,443 ms
コンパイル使用メモリ	214,480 KB
実行使用メモリ	4,380 KB
最終ジャッジ日時	2023-09-18 14:09:59
合計ジャッジ時間	4,593 ms
ジャッジサーバーID （参考情報）	judge13 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	2 ms 4,376 KB
testcase_07	AC	2 ms 4,376 KB
testcase_08	AC	1 ms 4,376 KB
testcase_09	AC	2 ms 4,376 KB
testcase_10	AC	2 ms 4,380 KB
testcase_11	AC	2 ms 4,380 KB
testcase_12	AC	2 ms 4,376 KB
testcase_13	AC	2 ms 4,380 KB
testcase_14	AC	1 ms 4,376 KB
testcase_15	AC	2 ms 4,376 KB
testcase_16	AC	2 ms 4,376 KB
testcase_17	AC	1 ms 4,380 KB
testcase_18	AC	1 ms 4,376 KB
testcase_19	AC	1 ms 4,380 KB
testcase_20	AC	2 ms 4,376 KB
testcase_21	AC	2 ms 4,376 KB
testcase_22	AC	2 ms 4,376 KB
testcase_23	AC	2 ms 4,376 KB
testcase_24	AC	2 ms 4,376 KB
testcase_25	AC	2 ms 4,376 KB
testcase_26	AC	3 ms 4,380 KB
testcase_27	AC	2 ms 4,376 KB
testcase_28	AC	3 ms 4,376 KB
testcase_29	AC	2 ms 4,380 KB
testcase_30	AC	2 ms 4,376 KB
testcase_31	AC	3 ms 4,380 KB
testcase_32	AC	3 ms 4,376 KB
testcase_33	AC	2 ms 4,376 KB
testcase_34	AC	2 ms 4,380 KB
testcase_35	AC	1 ms 4,376 KB

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

ソースコード

raw source code

// clang-format off
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
constexpr char ln = '\n';
template <class Container> inline int SZ(const Container& v) { return int(v.size()); }
template <class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x >> k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
inline void YES(bool t = true) { cout << YESNO[t] << "\n"; }
inline void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
template <class T> inline void drop(T x) { cout << x << "\n"; exit(0); }
inline void print() { cout << "\n"; }
template <class T> inline void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); }
template <class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_;
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// clang-format on

using Ans = tuple<string, int, int, int>;
int main() {
    int N, K;
    cin >> N >> K;

    int tmp = N;
    // [l,r)
    int memory_l = 0;
    int memory_r = N;
    int BIT_SIZE = topbit(N);

    vec<Ans> ans;
    auto UPD = [&](int i, int x) {
        assert(0 <= i and i <= N);
        assert(x == 0 or x == 1);
        ans.emplace_back("UPD", i, x, -1);
        return;
    };
    auto AND = [&](int i, int j, int k) {
        assert(0 <= i and i <= N);
        assert(0 <= j and j <= N);
        assert(0 <= k and k <= N);
        ans.emplace_back("AND", i, j, k);
    };
    auto XOR = [&](int i, int j, int k) {
        assert(0 <= i and i <= N);
        assert(0 <= j and j <= N);
        assert(0 <= k and k <= N);
        ans.emplace_back("XOR", i, j, k);
    };
    auto ANS = [&]() {
        cout << ans.size() << ln;
        for (auto& [str, i, j, k] : ans) {
            cout << str << " " << i << " " << j;
            if (~k) cout << " " << k;
            cout << ln;
        }
    };
    auto dbg = [&]() { ans.emplace_back("DBG", -1, -1, -1); };

    auto SWAP = [&](int i, int j) {
        assert(0 <= i and i <= N);
        assert(0 <= j and j <= N);
        if (i == j) return;
        XOR(i, i, j);  // x^y,y
        XOR(j, i, j);  // x^y,x
        XOR(i, i, j);  // y,x
        return;
    };
    auto compress = [&]() {
        int xor_l = memory_l;
        int xor_r = memory_r;
        int and_l = memory_l;
        int and_r = and_l;
        while (xor_r - xor_l > 1) {
            int cnt = (xor_r - xor_l) / 2;
            rep(c, cnt) {
                int i = xor_l + c * 2;
                int j = xor_l + c * 2 + 1;
                XOR(tmp, i, j);
                AND(i, i, j);
                SWAP(j, tmp);
                UPD(tmp, 0);
            }
            {
                int and_pos = xor_l + cnt;
                if (cnt & 1) and_pos++;
                int xor_pos = xor_l + 1;
                rep(k, cnt / 2) {
                    SWAP(and_pos, xor_pos);
                    and_pos += 2;
                    xor_pos += 2;
                }
            }
            and_r += cnt;
            xor_l += cnt;
            // dbg();
        }
        SWAP(xor_l, tmp);
        UPD(xor_l, 0);
        tmp--;
        memory_l = and_l;
        memory_r = and_r;
    };
    auto sub = [&](int k, int cnt) {
        XOR(cnt, cnt, k);
        AND(cnt, cnt, k);
        UPD(k, 0);
        return;
    };
    auto carry_down = [&](int carry, int cnt) {
        XOR(cnt, carry, cnt);
        AND(carry, cnt, carry);
        return;
    };
    auto solve = [&]() {
        // dbg();
        rep(k, BIT_SIZE + 1) {
            compress();
            // dbg();
        }
        int k = memory_l;
        int cnt = N;
        UPD(k, K & 1);
        sub(k, cnt);
        rep(b, BIT_SIZE) {
            int carry = cnt;
            cnt--;
            carry_down(carry, cnt);
            UPD(k, kthbit(K, b + 1));
            sub(k, cnt);
            XOR(cnt, cnt, carry);
        }
        SWAP(cnt, N);
        UPD(0, 1);
        XOR(N, 0, N);
    };
    solve();
    ANS();
    auto test = [&]() {
        debug(BIT_SIZE);
        int Q;
        cin >> Q;
        rep(_, Q) {
            vec<int> A(N + 1);
            rep(i, N) cin >> A[i];
            int S = accumulate(all(A), 0);
            auto B = A;
            for (auto& [str, i, j, k] : ans) {
                if (str == "UPD") {
                    B[i] = j;
                } else if (str == "AND") {
                    B[i] = B[j] & B[k];
                } else if (str == "XOR") {
                    B[i] = B[j] ^ B[k];
                } else if (str == "DBG") {
                    debug(B);
                }
            }
            if ((S >= K) ^ B[N]) {
                debug(B);
            }
        }
    };
    // test();
}

yukicoder

結果

テストケース

ソースコード