結果
問題 | No.1504 ヌメロニム |
ユーザー | KoD |
提出日時 | 2021-05-07 22:43:21 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,431 ms / 2,000 ms |
コード長 | 5,384 bytes |
コンパイル時間 | 3,286 ms |
コンパイル使用メモリ | 246,632 KB |
実行使用メモリ | 198,964 KB |
最終ジャッジ日時 | 2023-10-13 14:01:16 |
合計ジャッジ時間 | 32,068 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,352 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,352 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 1 ms
4,352 KB |
testcase_06 | AC | 1 ms
4,348 KB |
testcase_07 | AC | 1 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,352 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 1 ms
4,348 KB |
testcase_12 | AC | 1 ms
4,348 KB |
testcase_13 | AC | 2 ms
4,352 KB |
testcase_14 | AC | 2 ms
4,348 KB |
testcase_15 | AC | 1 ms
4,348 KB |
testcase_16 | AC | 1 ms
4,348 KB |
testcase_17 | AC | 1 ms
4,352 KB |
testcase_18 | AC | 1 ms
4,352 KB |
testcase_19 | AC | 1 ms
4,348 KB |
testcase_20 | AC | 7 ms
4,512 KB |
testcase_21 | AC | 4 ms
4,348 KB |
testcase_22 | AC | 7 ms
4,504 KB |
testcase_23 | AC | 2 ms
4,352 KB |
testcase_24 | AC | 1,390 ms
198,872 KB |
testcase_25 | AC | 644 ms
99,292 KB |
testcase_26 | AC | 1,381 ms
198,852 KB |
testcase_27 | AC | 650 ms
99,304 KB |
testcase_28 | AC | 665 ms
99,320 KB |
testcase_29 | AC | 1,363 ms
198,884 KB |
testcase_30 | AC | 1,382 ms
198,792 KB |
testcase_31 | AC | 658 ms
99,276 KB |
testcase_32 | AC | 644 ms
99,352 KB |
testcase_33 | AC | 1,376 ms
198,720 KB |
testcase_34 | AC | 148 ms
26,136 KB |
testcase_35 | AC | 138 ms
26,016 KB |
testcase_36 | AC | 652 ms
98,884 KB |
testcase_37 | AC | 67 ms
14,272 KB |
testcase_38 | AC | 1,375 ms
198,852 KB |
testcase_39 | AC | 1,389 ms
198,952 KB |
testcase_40 | AC | 1,408 ms
198,772 KB |
testcase_41 | AC | 1,431 ms
198,888 KB |
testcase_42 | AC | 1,391 ms
198,964 KB |
testcase_43 | AC | 1,401 ms
198,832 KB |
testcase_44 | AC | 1,390 ms
198,952 KB |
testcase_45 | AC | 1,395 ms
198,836 KB |
testcase_46 | AC | 1,376 ms
198,788 KB |
testcase_47 | AC | 1,405 ms
198,768 KB |
testcase_48 | AC | 645 ms
99,284 KB |
testcase_49 | AC | 656 ms
99,136 KB |
testcase_50 | AC | 8 ms
4,528 KB |
testcase_51 | AC | 5 ms
4,348 KB |
testcase_52 | AC | 1 ms
4,348 KB |
testcase_53 | AC | 5 ms
4,476 KB |
testcase_54 | AC | 2 ms
4,352 KB |
testcase_55 | AC | 156 ms
26,028 KB |
testcase_56 | AC | 1 ms
4,352 KB |
testcase_57 | AC | 2 ms
4,348 KB |
testcase_58 | AC | 2 ms
4,352 KB |
testcase_59 | AC | 1 ms
4,348 KB |
testcase_60 | AC | 2 ms
4,348 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/convolution> #include <atcoder/modint> using i32 = std::int32_t; using u32 = std::uint32_t; using i64 = std::int64_t; using u64 = std::uint64_t; using i128 = __int128_t; using u128 = __uint128_t; using isize = std::ptrdiff_t; using usize = std::size_t; class rep { struct Iter { usize itr; constexpr Iter(const usize pos) noexcept : itr(pos) {} constexpr void operator++() noexcept { ++itr; } constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; } constexpr usize operator*() const noexcept { return itr; } }; const Iter first, last; public: explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {} constexpr Iter begin() const noexcept { return first; } constexpr Iter end() const noexcept { return last; } }; class revrep { struct Iter { usize itr; constexpr Iter(const usize pos) noexcept : itr(pos) {} constexpr void operator++() noexcept { --itr; } constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; } constexpr usize operator*() const noexcept { return itr; } }; const Iter first, last; public: explicit constexpr revrep(const usize first, const usize last) noexcept : first(last - 1), last(std::min(first, last) - 1) {} constexpr Iter begin() const noexcept { return first; } constexpr Iter end() const noexcept { return last; } }; constexpr u64 ceil_log2(const u64 x) { u64 e = 0; while (((u64)1 << e) < x) ++e; return e; } template <class F> class AutoRealloc { using R = typename decltype(std::declval<F>()((usize)0))::value_type; F func; mutable std::vector<R> data; public: template <class G> explicit AutoRealloc(G&& g) : func(std::forward<G>(g)), data() {} void reserve(const usize size) const { if (data.size() < size) data = func(((usize)1 << ceil_log2(size))); } R operator[](const usize i) const { reserve(i + 1); return data[i]; } }; template <class G> explicit AutoRealloc(G&&) -> AutoRealloc<std::decay_t<G>>; template <class M> struct ModintUtil { static inline const auto fact = AutoRealloc([](const usize n) { std::vector<M> ret(n); ret[0] = M(1); for (const usize i : rep(1, n)) { ret[i] = ret[i - 1] * M(i); } return ret; }); static inline const auto inv = AutoRealloc([](const usize n) { std::vector<M> ret(n); if (n == 1) return ret; ret[1] = M(1); for (const usize i : rep(2, n)) { ret[i] = -M(M::mod() / i) * ret[M::mod() % i]; } return ret; }); static inline const auto inv_fact = AutoRealloc([](const usize n) { std::vector<M> ret(n); ret[0] = M(1); for (const usize i : rep(1, n)) { ret[i] = ret[i - 1] * inv[i]; } return ret; }); static M binom(const usize n, const usize k) { assert(k <= n); return fact[n] * inv_fact[n - k] * inv_fact[k]; } static M factpow(const usize n, const usize k) { assert(k <= n); return fact[n] * inv_fact[n - k]; } static M homo(const usize n, const usize k) { if (n == 0 and k == 0) return M(1); return binom(n + k - 1, k); } }; template <class T> using Vec = std::vector<T>; using Fp = atcoder::modint998244353; using Util = ModintUtil<Fp>; using Poly = Vec<Fp>; Poly operator+(const Poly& p, const Poly& q) { Poly r(std::max(p.size(), q.size())); for (const auto i : rep(0, p.size())) { r[i] += p[i]; } for (const auto i : rep(0, q.size())) { r[i] += q[i]; } return r; } Poly operator*(const Poly& p, const Poly& q) { return atcoder::convolution(p, q); } struct Data { Vec<Fp> left0, right1; Data() : left0(1, Fp(0)), right1(1, Fp(0)) {} }; void F_main() { usize N; std::cin >> N; Vec<bool> S(N); for (const auto i : rep(0, N)) { char c; std::cin >> c; S[i] = (c == 'n'); } const usize H = ceil_log2(N); const usize M = 1 << H; Vec<Data> data(2 * M); for (const auto i : rep(0, N)) { if (S[i]) { data[M + i].right1[0] = 1; } else { data[M + i].left0[0] = 1; } } Vec<Fp> ans(N - 1); for (const auto i : revrep(1, M)) { { usize idx = 0; for (const auto x : data[2 * i].left0* data[2 * i + 1].right1) { if (idx <= N - 2) { ans[idx] += x; } idx += 1; } } const auto size = data[2 * i].left0.size(); Vec<Fp> mul(size + 1); for (const auto i : rep(0, size + 1)) { mul[i] = Util::binom(size, i); } data[i].left0 = data[2 * i].left0 * mul + data[2 * i + 1].left0; data[i].right1 = data[2 * i].right1 + data[2 * i + 1].right1 * mul; } u32 sum = 0; for (const auto x : ans) { sum ^= x.val(); } std::cout << sum << '\n'; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); F_main(); return 0; }