#715432 (C++17) No.1741 Arrays and XOR Procedure

提出ソース

結果

問題	No.1741 Arrays and XOR Procedure
ユーザー	Forested
提出日時	2021-11-12 21:57:44
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,917 bytes
コンパイル時間	900 ms
コンパイル使用メモリ	119,000 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-05-04 08:34:13
合計ジャッジ時間	2,777 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	38 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	WA	-
testcase_06	AC	38 ms 6,940 KB
testcase_07	AC	40 ms 6,940 KB
testcase_08	AC	38 ms 6,940 KB
testcase_09	AC	34 ms 6,940 KB
testcase_10	AC	35 ms 6,940 KB
testcase_11	AC	27 ms 6,940 KB
testcase_12	AC	22 ms 6,940 KB
testcase_13	AC	35 ms 6,940 KB
testcase_14	AC	24 ms 6,944 KB
testcase_15	AC	31 ms 6,940 KB
testcase_16	AC	3 ms 6,944 KB
testcase_17	AC	11 ms 6,944 KB
testcase_18	AC	25 ms 6,940 KB
testcase_19	AC	3 ms 6,944 KB
testcase_20	AC	38 ms 6,940 KB
testcase_21	AC	30 ms 6,944 KB
testcase_22	AC	27 ms 6,944 KB
testcase_23	AC	11 ms 6,940 KB
testcase_24	AC	4 ms 6,940 KB
testcase_25	AC	37 ms 6,940 KB
testcase_26	AC	16 ms 6,940 KB
testcase_27	WA	-
testcase_28	AC	28 ms 6,944 KB
testcase_29	AC	32 ms 6,944 KB
testcase_30	AC	28 ms 6,944 KB
testcase_31	AC	3 ms 6,944 KB
testcase_32	AC	16 ms 6,944 KB
testcase_33	AC	19 ms 6,940 KB
testcase_34	AC	8 ms 6,940 KB
testcase_35	WA	-
testcase_36	AC	5 ms 6,944 KB
testcase_37	AC	13 ms 6,940 KB
testcase_38	AC	36 ms 6,940 KB
testcase_39	AC	13 ms 6,940 KB
testcase_40	AC	1 ms 6,944 KB
testcase_41	AC	7 ms 6,944 KB
testcase_42	AC	3 ms 6,940 KB
testcase_43	AC	1 ms 6,940 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (n); ++i)
#define REP3(i, m, n) for (i32 i = (m); i < (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

[[maybe_unused]] constexpr i32 inf = 1000000100;
[[maybe_unused]] constexpr i64 inf64 = 3000000000000000100;

struct SetIO {
    SetIO() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(10);
    }
} set_io;

// ----- "mod_int.hpp" -----
#ifndef MOD_INT_HPP
#define MOD_INT_HPP

#include <cassert>
#include <type_traits>
#include <iostream>

// ----- "utils.hpp" -----
#ifndef UTILS_HPP
#define UTILS_HPP

#include <cstddef>
 
 
constexpr bool is_prime(unsigned n) {
    if (n == 0 || n == 1)
        return false;
    for (unsigned i = 2; i * i <= n; ++i) {
        if (n % i == 0)
            return false;
    }
    return true;
}
 
constexpr unsigned mod_pow(unsigned x, unsigned y, unsigned mod) {
    unsigned ret = 1, self = x;
    while (y != 0) {
        if (y & 1)
            ret = (unsigned long long) ret * self % mod;
        self = (unsigned long long) self * self % mod;
        y >>= 1;
    }
    return ret;
}
 
template <unsigned mod>
constexpr unsigned primitive_root() {
    static_assert(is_prime(mod), "`mod` must be a prime number.");
    if (mod == 2)
        return 1;
    
    unsigned primes[32] = {};
    std::size_t it = 0;
    {
        unsigned m = mod - 1;
        for (unsigned i = 2; i * i <= m; ++i) {
            if (m % i == 0) {
                primes[it++] = i;
                while (m % i == 0)
                    m /= i;
            }
        }
        if (m != 1)
            primes[it++] = m;
    }
    for (unsigned i = 2; i < mod; ++i) {
        bool ok = true;
        for (std::size_t j = 0; j < it; ++j) {
            if (mod_pow(i, (mod - 1) / primes[j], mod) == 1) {
                ok = false;
                break;
            }
        }
        if (ok)
            return i;
    }
    return 0;
}

#endif
// ----- "utils.hpp" -----

template <typename T, std::enable_if_t<std::is_signed_v<T>> * = nullptr>
constexpr unsigned safe_mod(T x, unsigned mod) {
    if (x < 0) {
        return (unsigned) (x % mod + mod);
    } else {
        return (unsigned) (x % mod);
    }
}

template <typename T, std::enable_if_t<std::is_unsigned_v<T>> * = nullptr>
constexpr unsigned safe_mod(T x, unsigned mod) {
    return (unsigned) (x % mod);
}

template <unsigned mod> class ModInt {
    static_assert(mod != 0, "`mod` must not be equal to 0.");
    static_assert(mod < (1u << 31), "`mod` must be less than (1u << 31) = 2147483648.");
    
    unsigned val;
    
public:
    constexpr ModInt() : val(0) {}
    template <typename T> constexpr ModInt(T x) : val(safe_mod(x, mod)) {}
    
    static constexpr ModInt raw(unsigned x) {
        ModInt<mod> ret;
        ret.val = x;
        return ret;
    }
    
    constexpr unsigned get_val() const {
        return val;
    }
    
    constexpr ModInt operator+() const {
        return *this;
    }
    constexpr ModInt operator-() const {
        return ModInt<mod>(0u) - *this;
    }
    
    constexpr ModInt &operator+=(const ModInt &rhs) {
        val += rhs.val;
        if (val >= mod)
            val -= mod;
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt &rhs) {
        if (val < rhs.val)
            val += mod;
        val -= rhs.val;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt &rhs) {
        val = (unsigned long long) val * rhs.val % mod;
        return *this;
    }
    constexpr ModInt &operator/=(const ModInt &rhs) {
        val = (unsigned long long) val * rhs.inv().val % mod;
        return *this;
    }
    
    friend constexpr ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) += rhs;
    }
    friend constexpr ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) -= rhs;
    }
    friend constexpr ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) *= rhs;
    }
    friend constexpr ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) /= rhs;
    }
    
    constexpr ModInt pow(unsigned x) const {
        ModInt<mod> ret = ModInt<mod>::raw(1);
        ModInt<mod> self = *this;
        while (x != 0) {
            if (x & 1)
                ret *= self;
            self *= self;
            x >>= 1;
        }
        return ret;
    }
    constexpr ModInt inv() const {
        static_assert(is_prime(mod), "`mod` must be a prime number.");
        assert(val != 0);
        return this->pow(mod - 2);
    }
    
    friend std::istream &operator>>(std::istream &is, ModInt<mod> &x) {
        is >> x.val;
        // x.val %= mod;
        return is;
    }
    
    friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &x) {
        os << x.val;
        return os;
    }
    
    friend bool operator==(const ModInt &lhs, const ModInt &rhs) {
        return lhs.val == rhs.val;
    }
};

[[maybe_unused]] constexpr unsigned mod998244353 = 998244353;
[[maybe_unused]] constexpr unsigned mod1000000007 = 1000000007;

#endif
// ----- "mod_int.hpp" -----

using Mint = ModInt<mod998244353>;

i32 fact_ord2(i32 n) {
    i32 ans = 0;
    for (i32 k = 2; k <= n; k *= 2) {
        ans += n / k;
    }
    return ans;
}

i32 comb_mod2(i32 n, i32 r) {
    return fact_ord2(n) - fact_ord2(r) - fact_ord2(n - r) == 0 ? 1 : 0;
}

int main() {
    i32 n;
    cin >> n;
    bool free = false;
    i32 cnt = 0, sum = 0;
    REP(i, n) {
        i32 x;
        cin >> x;
        if (x == -1) {
            if (comb_mod2(n, i) == 1) {
                free = true;
            }
            ++cnt;
        } else {
            sum += comb_mod2(n, i) * x;
        }
    }
    if (free) {
        cout << Mint::raw(2).pow(cnt - 1) << '\n';
    } else {
        cout << (sum % 2 == 1 ? 1 : 0) << '\n';
    }
}

yukicoder

結果

テストケース

ソースコード