#900031 (C++17) No.1958 Bit Game

提出ソース

結果

問題	No.1958 Bit Game
ユーザー	satashun
提出日時	2023-08-10 22:35:31
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	66 ms / 2,000 ms
コード長	12,131 bytes
コンパイル時間	2,792 ms
コンパイル使用メモリ	217,308 KB
実行使用メモリ	6,824 KB
最終ジャッジ日時	2024-11-17 08:48:22
合計ジャッジ時間	7,759 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	65 ms 6,816 KB
testcase_01	AC	65 ms 6,820 KB
testcase_02	AC	62 ms 6,816 KB
testcase_03	AC	65 ms 6,816 KB
testcase_04	AC	64 ms 6,816 KB
testcase_05	AC	66 ms 6,824 KB
testcase_06	AC	65 ms 6,820 KB
testcase_07	AC	65 ms 6,820 KB
testcase_08	AC	65 ms 6,816 KB
testcase_09	AC	62 ms 6,820 KB
testcase_10	AC	15 ms 6,816 KB
testcase_11	AC	31 ms 6,820 KB
testcase_12	AC	41 ms 6,820 KB
testcase_13	AC	32 ms 6,816 KB
testcase_14	AC	30 ms 6,820 KB
testcase_15	AC	49 ms 6,816 KB
testcase_16	AC	33 ms 6,816 KB
testcase_17	AC	53 ms 6,816 KB
testcase_18	AC	53 ms 6,816 KB
testcase_19	AC	37 ms 6,816 KB
testcase_20	AC	30 ms 6,816 KB
testcase_21	AC	49 ms 6,816 KB
testcase_22	AC	13 ms 6,816 KB
testcase_23	AC	25 ms 6,820 KB
testcase_24	AC	45 ms 6,820 KB
testcase_25	AC	27 ms 6,816 KB
testcase_26	AC	32 ms 6,816 KB
testcase_27	AC	43 ms 6,816 KB
testcase_28	AC	37 ms 6,820 KB
testcase_29	AC	19 ms 6,820 KB
testcase_30	AC	2 ms 6,816 KB
testcase_31	AC	2 ms 6,816 KB
testcase_32	AC	2 ms 6,820 KB

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

ソースコード

raw source code

#pragma region satashun
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#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>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template <typename T, typename V>
void fill_vec(T& v, const V& val) {
    v = val;
}

template <typename T, typename V>
void fill_vec(vector<T>& vec, const V& val) {
    for (auto& v : vec) fill_vec(v, val);
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <typename T>
int arglb(const V<T>& v, const T& x) {
    return distance(v.begin(), lower_bound(ALL(v), x));
}

template <typename T>
int argub(const V<T>& v, const T& x) {
    return distance(v.begin(), upper_bound(ALL(v), x));
}

template <class T>
void mkuni(vector<T>& v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), end(v));
}

template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
    vector<int> res(v.size());
    iota(res.begin(), res.end(), 0);

    if (increasing) {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] < v[j]; });
    } else {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] > v[j]; });
    }
    return res;
}

// prototype
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p);

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v);

template <class T>
istream& operator>>(istream& is, vector<T>& v);

template <class T, size_t sz>
ostream& operator<<(ostream& os, const array<T, sz>& arr);

template <class T>
ostream& operator<<(ostream& os, const set<T>& ST);

template <class T>
ostream& operator<<(ostream& os, const multiset<T>& ST);

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP);

ostream& operator<<(ostream& o, __int128_t x);

// io functions
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) {
        is >> x;
    }
    return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

template <class T, size_t sz>
ostream& operator<<(ostream& os, const array<T, sz>& arr) {
    os << '[';
    for (auto v : arr) os << v << ',';
    os << ']';
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const set<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const multiset<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP) {
    for (auto it = MP.begin(); it != MP.end(); ++it) {
        os << "(" << it->first << ": " << it->second << ")";
    }
    return os;
}

string to_string(__int128_t x) {
    if (x == 0) return "0";
    string result;
    if (x < 0) {
        result += "-";
        x *= -1;
    }
    string t;
    while (x) {
        t.push_back('0' + x % 10);
        x /= 10;
    }
    reverse(t.begin(), t.end());
    return result + t;
}

ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); }

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
V<T>& operator+=(V<T>& vec, const T& v) {
    for (auto& x : vec) x += v;
    return vec;
}

template <class T>
V<T>& operator-=(V<T>& vec, const T& v) {
    for (auto& x : vec) x -= v;
    return vec;
}

// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class T>
void show(T x) {
    print(x, 1);
}

template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
    print(H, 2);
    show(T...);
}

int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(int t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
int bit_parity(int t) { return __builtin_parity(t); }
int bit_parity(ll t) { return __builtin_parityll(t); }

struct prepare_io {
    prepare_io() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} prep_io;
#pragma endregion satashun

template <unsigned int MOD>
struct ModInt {
    using uint = unsigned int;
    using ull = unsigned long long;
    using M = ModInt;

    uint v;

    ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
    M& set_norm(uint _v) {  //[0, MOD * 2)->[0, MOD)
        v = (_v < MOD) ? _v : _v - MOD;
        return *this;
    }

    explicit operator bool() const { return v != 0; }
    explicit operator int() const { return v; }
    M operator+(const M& a) const { return M().set_norm(v + a.v); }
    M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
    M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
    M operator/(const M& a) const { return *this * a.inv(); }
    M& operator+=(const M& a) { return *this = *this + a; }
    M& operator-=(const M& a) { return *this = *this - a; }
    M& operator*=(const M& a) { return *this = *this * a; }
    M& operator/=(const M& a) { return *this = *this / a; }
    M operator-() const { return M() - *this; }
    M& operator++(int) { return *this = *this + 1; }
    M& operator--(int) { return *this = *this - 1; }

    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M x = *this, res = 1;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    M inv() const {
        ll a = v, b = MOD, p = 1, q = 0, t;
        while (b != 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(p -= t * q, q);
        }
        return M(p);
    }

    friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
    friend istream& operator>>(istream& in, M& x) {
        ll v_;
        in >> v_;
        x = M(v_);
        return in;
    }

    bool operator<(const M& r) const { return v < r.v; }
    bool operator>(const M& r) const { return v < *this; }
    bool operator<=(const M& r) const { return !(r < *this); }
    bool operator>=(const M& r) const { return !(*this < r); }
    bool operator==(const M& a) const { return v == a.v; }
    bool operator!=(const M& a) const { return v != a.v; }

    static uint get_mod() { return MOD; }
};

// using Mint = ModInt<1000000007>;
using Mint = ModInt<998244353>;

template <class T>
bool is_zero(T x) {
    return x == 0;
}

template <class T>
bool is_one(T x) {
    return x == 1;
}

template <class T>
struct Matrix {
    int H, W;
    VV<T> a;
    Matrix() : H(0), W(0) {}
    Matrix(int H, int W) : H(H), W(W), a(VV<T>(H, V<T>(W))) {}
    Matrix(const VV<T>& v) : H(v.size()), W(v[0].size()), a(v) {}
    static Matrix E(int n) {
        Matrix a(n, n);
        rep(i, n) a.set(i, i, 1);
        return a;
    }
    T at(int i, int j) const { return a[i][j]; }
    void set(int i, int j, T v) { a[i][j] = v; }
    Matrix operator+(const Matrix& r) const {
        assert(H == r.H && W == r.W);
        VV<T> v(H, V<T>(W));
        rep(i, H) rep(j, W) v[i][j] = a[i][j] + r.a[i][j];
        return Matrix(v);
    }
    Matrix operator-(const Matrix& r) const {
        assert(H == r.H && W == r.W);
        VV<T> v(H, V<T>(W));
        rep(i, H) rep(j, W) v[i][j] = a[i][j] - r.a[i][j];
        return Matrix(v);
    }
    Matrix operator*(const Matrix& r) const {
        assert(W == r.H);
        VV<T> v(H, V<T>(r.W));
        rep(i, H) rep(k, W) rep(j, r.W) v[i][j] += a[i][k] * r.a[k][j];
        return Matrix(v);
    }
    Matrix& operator+=(const Matrix& r) { return (*this) = (*this) + r; }
    Matrix& operator-=(const Matrix& r) { return (*this) = (*this) - r; }
    Matrix& operator*=(const Matrix& r) { return (*this) = (*this) * r; }
    /*
    副作⽤がある, 基本的に⾃分でこれを呼ぶことはない
    掃き出し法をする
    左からvar列が掃き出す対象で、それより右は同時に値を変更するだけ(e.g. 逆⾏列
    は右に単位⾏列おいてから掃き出す)
    ⾏swap, 列swap は⾏わない
    rank を返す
    */
    int sweep(int var) {
        int rank = 0;
        vector<bool> used(H);
        rep(j, var) {
            int i = 0;
            while (i < H && (used[i] || is_zero(a[i][j]))) i++;
            if (i == H) continue;
            used[i] = true;
            rank++;
            T t = a[i][j];
            rep(k, W) a[i][k] = a[i][k] / t;
            rep(k, H) if (k != i) {
                T t = a[k][j];
                rep(l, W) a[k][l] = a[k][l] - a[i][l] * t;
            }
        }
        return rank;
    }

    Matrix pow(ll n) const {
        assert(H == W);
        int h = H;
        Matrix x = *this, res(h, h);
        res = E(h);
        while (n > 0) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    friend ostream& operator<<(ostream& o, const Matrix& A) {
        rep(i, A.H) {
            rep(j, A.W) o << A.a[i][j] << " ";
            o << endl;
        }
        return o;
    }
};

void slv() {
    // input
    int N, X, Y;
    cin >> N >> X >> Y;
    V<int> A(X), B(Y);
    cin >> A >> B;
    V<int> ca(2), cb(2);
    for (int x : A) {
        ca[x % 2]++;
    }
    for (int x : B) {
        cb[x % 2]++;
    }

    // solve
    Mint ans;
    rep(i, 18) {
        Matrix<Mint> a(2, 2);
        V<ll> ca(2), cb(2);
        for (int x : A) {
            ca[x >> i & 1]++;
        }
        for (int x : B) {
            cb[x >> i & 1]++;
        }

        rep(f, 2) {
            rep(p, 2) {
                rep(q, 2) { a.a[f][(f | p) & q] += ca[p] * cb[q]; }
            }
        }
        a = a.pow(N);
        ans += a.a[0][1] * Mint(2).pow(i);
    }
    show(ans);
}

int main() {
    int cases = 1;
    // cin >> cases;
    rep(i, cases) slv();

    return 0;
}

yukicoder

結果

テストケース

ソースコード