#718134 (C++23) No.1753 Don't cheat.

提出ソース

結果

問題	No.1753 Don't cheat.
ユーザー	hitonanode
提出日時	2021-11-19 22:56:42
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	164 ms / 3,000 ms
コード長	6,647 bytes
コンパイル時間	1,667 ms
コンパイル使用メモリ	177,280 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-10 10:18:28
合計ジャッジ時間	8,064 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	154 ms 6,812 KB
testcase_01	AC	158 ms 6,940 KB
testcase_02	AC	161 ms 6,940 KB
testcase_03	AC	156 ms 6,944 KB
testcase_04	AC	155 ms 6,940 KB
testcase_05	AC	154 ms 6,944 KB
testcase_06	AC	154 ms 6,944 KB
testcase_07	AC	154 ms 6,940 KB
testcase_08	AC	156 ms 6,944 KB
testcase_09	AC	155 ms 6,940 KB
testcase_10	AC	158 ms 6,944 KB
testcase_11	AC	159 ms 6,940 KB
testcase_12	AC	153 ms 6,944 KB
testcase_13	AC	154 ms 6,944 KB
testcase_14	AC	158 ms 6,944 KB
testcase_15	AC	163 ms 6,940 KB
testcase_16	AC	158 ms 6,940 KB
testcase_17	AC	164 ms 6,940 KB
testcase_18	AC	155 ms 6,944 KB
testcase_19	AC	154 ms 6,940 KB
testcase_20	AC	156 ms 6,944 KB
testcase_21	AC	160 ms 6,944 KB
testcase_22	AC	162 ms 6,940 KB
testcase_23	AC	158 ms 6,940 KB
testcase_24	AC	157 ms 6,940 KB
testcase_25	AC	152 ms 6,940 KB
testcase_26	AC	156 ms 6,940 KB
testcase_27	AC	154 ms 6,944 KB
testcase_28	AC	160 ms 6,940 KB
testcase_29	AC	154 ms 6,944 KB
testcase_30	AC	152 ms 6,944 KB
testcase_31	AC	155 ms 6,940 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
constexpr int len = 8;
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
constexpr int len = 1024;
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif


#include <atcoder/modint>
using mint = atcoder::modint998244353;

// Fast Walsh-Hadamard transform and its abstraction
// Tutorials: <https://codeforces.com/blog/entry/71899>
//            <https://csacademy.com/blog/fast-fourier-transform-and-variations-of-it>
template <typename T, typename F> void abstract_fwht(std::vector<T>& seq, F f) {
    const int n = seq.size();
    assert(__builtin_popcount(n) == 1);
    for (int w = 1; w < n; w *= 2) {
        for (int i = 0; i < n; i += w * 2) {
            for (int j = 0; j < w; j++) { f(seq[i + j], seq[i + j + w]); }
        }
    }
}



int main() {
    int N;
    cin >> N;
    vector<mint> A(N + 1);
    for (auto &a : A) {
        int x;
        cin >> x;
        a = x;
    }
    mint sumainv = accumulate(A.begin(), A.end(), mint(0)).inv();
    for (auto &x : A) x *= sumainv;

    mint p0 = A[0];
    A[0] = 0;

    auto f = [](mint &lo, mint &hi) {
        mint c = lo + hi;
        hi = lo - hi, lo = c;
    };
    A.resize(len);

    mint ret = len;

    FOR(i, 1, len) {
        auto trans = A;
        trans[i] = 0;
        vector<mint> dp(len);
        dp[i] = 1;
        abstract_fwht(trans, f);
        abstract_fwht(dp, f);
        for (auto &a : trans) a = (1 - a).inv();
        REP(i, dp.size()) dp[i] *= trans[i];
        abstract_fwht(dp, f);
        ret -= dp[0] * p0;
    }
    cout << (1 - ret / len).val() << '\n';
}

yukicoder

結果

テストケース

ソースコード