結果
問題 | No.2265 Xor Range Substring Sum Query |
ユーザー | suisen |
提出日時 | 2023-04-07 23:31:27 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 19,748 bytes |
コンパイル時間 | 3,486 ms |
コンパイル使用メモリ | 321,892 KB |
実行使用メモリ | 54,880 KB |
最終ジャッジ日時 | 2024-10-02 20:41:42 |
合計ジャッジ時間 | 53,280 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2,579 ms
54,748 KB |
testcase_05 | AC | 2,558 ms
54,744 KB |
testcase_06 | AC | 2,500 ms
54,764 KB |
testcase_07 | AC | 2,519 ms
54,744 KB |
testcase_08 | AC | 2,566 ms
54,620 KB |
testcase_09 | AC | 4,284 ms
54,748 KB |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | TLE | - |
testcase_14 | AC | 250 ms
54,748 KB |
testcase_15 | AC | 216 ms
54,748 KB |
testcase_16 | AC | 402 ms
54,748 KB |
testcase_17 | AC | 387 ms
54,748 KB |
testcase_18 | AC | 791 ms
54,620 KB |
testcase_19 | AC | 825 ms
54,616 KB |
testcase_20 | AC | 969 ms
54,744 KB |
testcase_21 | AC | 954 ms
54,616 KB |
testcase_22 | AC | 1,895 ms
28,032 KB |
testcase_23 | AC | 1,978 ms
28,032 KB |
ソースコード
#include <bits/stdc++.h> #ifdef _MSC_VER # include <intrin.h> #else # include <x86intrin.h> #endif #include <limits> #include <type_traits> namespace suisen { // ! utility template <typename ...Types> using constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>; template <bool cond_v, typename Then, typename OrElse> constexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) { if constexpr (cond_v) { return std::forward<Then>(then); } else { return std::forward<OrElse>(or_else); } } // ! function template <typename ReturnType, typename Callable, typename ...Args> using is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>; template <typename F, typename T> using is_uni_op = is_same_as_invoke_result<T, F, T>; template <typename F, typename T> using is_bin_op = is_same_as_invoke_result<T, F, T, T>; template <typename Comparator, typename T> using is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>; // ! integral template <typename T, typename = constraints_t<std::is_integral<T>>> constexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits; template <typename T, unsigned int n> struct is_nbit { static constexpr bool value = bit_num<T> == n; }; template <typename T, unsigned int n> static constexpr bool is_nbit_v = is_nbit<T, n>::value; // ? template <typename T> struct safely_multipliable {}; template <> struct safely_multipliable<int> { using type = long long; }; template <> struct safely_multipliable<long long> { using type = __int128_t; }; template <> struct safely_multipliable<unsigned int> { using type = unsigned long long; }; template <> struct safely_multipliable<unsigned long int> { using type = __uint128_t; }; template <> struct safely_multipliable<unsigned long long> { using type = __uint128_t; }; template <> struct safely_multipliable<float> { using type = float; }; template <> struct safely_multipliable<double> { using type = double; }; template <> struct safely_multipliable<long double> { using type = long double; }; template <typename T> using safely_multipliable_t = typename safely_multipliable<T>::type; template <typename T, typename = void> struct rec_value_type { using type = T; }; template <typename T> struct rec_value_type<T, std::void_t<typename T::value_type>> { using type = typename rec_value_type<typename T::value_type>::type; }; template <typename T> using rec_value_type_t = typename rec_value_type<T>::type; } // namespace suisen // ! type aliases using i128 = __int128_t; using u128 = __uint128_t; template <typename T> using pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>; // ! macros (internal) #define DETAIL_OVERLOAD2(_1,_2,name,...) name #define DETAIL_OVERLOAD3(_1,_2,_3,name,...) name #define DETAIL_OVERLOAD4(_1,_2,_3,_4,name,...) name #define DETAIL_REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s)) #define DETAIL_REP3(i,l,r) DETAIL_REP4(i,l,r,1) #define DETAIL_REP2(i,n) DETAIL_REP3(i,0,n) #define DETAIL_REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s)) #define DETAIL_REPINF2(i,l) DETAIL_REPINF3(i,l,1) #define DETAIL_REPINF1(i) DETAIL_REPINF2(i,0) #define DETAIL_RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s)) #define DETAIL_RREP3(i,l,r) DETAIL_RREP4(i,l,r,1) #define DETAIL_RREP2(i,n) DETAIL_RREP3(i,0,n) #define DETAIL_CAT_I(a, b) a##b #define DETAIL_CAT(a, b) DETAIL_CAT_I(a, b) #define DETAIL_UNIQVAR(tag) DETAIL_CAT(tag, __LINE__) // ! macros #define REP(...) DETAIL_OVERLOAD4(__VA_ARGS__, DETAIL_REP4 , DETAIL_REP3 , DETAIL_REP2 )(__VA_ARGS__) #define RREP(...) DETAIL_OVERLOAD4(__VA_ARGS__, DETAIL_RREP4 , DETAIL_RREP3 , DETAIL_RREP2 )(__VA_ARGS__) #define REPINF(...) DETAIL_OVERLOAD3(__VA_ARGS__, DETAIL_REPINF3, DETAIL_REPINF2, DETAIL_REPINF1)(__VA_ARGS__) #define LOOP(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> DETAIL_UNIQVAR(loop_variable) = n; DETAIL_UNIQVAR(loop_variable) --> 0;) #define ALL(iterable) std::begin(iterable), std::end(iterable) #define INPUT(type, ...) type __VA_ARGS__; read(__VA_ARGS__) // ! debug #ifdef LOCAL # define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__) template <class T, class... Args> void debug_internal(const char* s, T&& first, Args&&... args) { constexpr const char* prefix = "[\033[32mDEBUG\033[m] "; constexpr const char* open_brakets = sizeof...(args) == 0 ? "" : "("; constexpr const char* close_brakets = sizeof...(args) == 0 ? "" : ")"; std::cerr << prefix << open_brakets << s << close_brakets << ": " << open_brakets << std::forward<T>(first); ((std::cerr << ", " << std::forward<Args>(args)), ...); std::cerr << close_brakets << "\n"; } #else # define debug(...) void(0) #endif // ! I/O utilities // __int128_t std::ostream& operator<<(std::ostream& dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char* d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } // __uint128_t std::ostream& operator<<(std::ostream& dest, __uint128_t value) { std::ostream::sentry s(dest); if (s) { char buffer[128]; char* d = std::end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } // pair template <typename T, typename U> std::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) { return out << a.first << ' ' << a.second; } // tuple template <unsigned int N = 0, typename ...Args> std::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) { if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) return out; else { out << std::get<N>(a); if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) out << ' '; return operator<<<N + 1>(out, a); } } // vector template <typename T> std::ostream& operator<<(std::ostream& out, const std::vector<T>& a) { for (auto it = a.begin(); it != a.end();) { out << *it; if (++it != a.end()) out << ' '; } return out; } // array template <typename T, size_t N> std::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) { for (auto it = a.begin(); it != a.end();) { out << *it; if (++it != a.end()) out << ' '; } return out; } inline void print() { std::cout << '\n'; } template <typename Head, typename... Tail> inline void print(const Head& head, const Tail &...tails) { std::cout << head; if (sizeof...(tails)) std::cout << ' '; print(tails...); } template <typename Iterable> auto print_all(const Iterable& v, std::string sep = " ", std::string end = "\n") -> decltype(std::cout << *v.begin(), void()) { for (auto it = v.begin(); it != v.end();) { std::cout << *it; if (++it != v.end()) std::cout << sep; } std::cout << end; } __int128_t stoi128(const std::string& s) { __int128_t ret = 0; for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0'; if (s[0] == '-') ret = -ret; return ret; } __uint128_t stou128(const std::string& s) { __uint128_t ret = 0; for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0'; return ret; } // __int128_t std::istream& operator>>(std::istream& in, __int128_t& v) { std::string s; in >> s; v = stoi128(s); return in; } // __uint128_t std::istream& operator>>(std::istream& in, __uint128_t& v) { std::string s; in >> s; v = stou128(s); return in; } // pair template <typename T, typename U> std::istream& operator>>(std::istream& in, std::pair<T, U>& a) { return in >> a.first >> a.second; } // tuple template <unsigned int N = 0, typename ...Args> std::istream& operator>>(std::istream& in, std::tuple<Args...>& a) { if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) return in; else return operator>><N + 1>(in >> std::get<N>(a), a); } // vector template <typename T> std::istream& operator>>(std::istream& in, std::vector<T>& a) { for (auto it = a.begin(); it != a.end(); ++it) in >> *it; return in; } // array template <typename T, size_t N> std::istream& operator>>(std::istream& in, std::array<T, N>& a) { for (auto it = a.begin(); it != a.end(); ++it) in >> *it; return in; } template <typename ...Args> void read(Args &...args) { (std::cin >> ... >> args); } // ! integral utilities // Returns pow(-1, n) template <typename T> constexpr inline int pow_m1(T n) { return -(n & 1) | 1; } // Returns pow(-1, n) template <> constexpr inline int pow_m1<bool>(bool n) { return -int(n) | 1; } // Returns floor(x / y) template <typename T> constexpr inline T fld(const T x, const T y) { return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y; } template <typename T> constexpr inline T cld(const T x, const T y) { return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y; } template <typename T, std::enable_if_t<std::negation_v<suisen::is_nbit<T, 64>>, std::nullptr_t> = nullptr> __attribute__((target("popcnt"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); } template <typename T, std::enable_if_t<suisen::is_nbit_v<T, 64>, std::nullptr_t> = nullptr> __attribute__((target("popcnt"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); } template <typename T, std::enable_if_t<std::negation_v<suisen::is_nbit<T, 64>>, std::nullptr_t> = nullptr> constexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; } template <typename T, std::enable_if_t<suisen::is_nbit_v<T, 64>, std::nullptr_t> = nullptr> constexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; } template <typename T, std::enable_if_t<std::negation_v<suisen::is_nbit<T, 64>>, std::nullptr_t> = nullptr> constexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; } template <typename T, std::enable_if_t<suisen::is_nbit_v<T, 64>, std::nullptr_t> = nullptr> constexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; } template <typename T> constexpr inline int floor_log2(const T x) { return suisen::bit_num<T> - 1 - count_lz(x); } template <typename T> constexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); } template <typename T> constexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; } template <typename T> constexpr inline int parity(const T x) { return popcount(x) & 1; } // ! container template <typename T, typename Comparator> auto priqueue_comp(const Comparator comparator) { return std::priority_queue<T, std::vector<T>, Comparator>(comparator); } template <typename Container> void sort_unique_erase(Container& a) { std::sort(a.begin(), a.end()); a.erase(std::unique(a.begin(), a.end()), a.end()); } template <typename InputIterator, typename BiConsumer> auto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) { if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr); } template <typename Container, typename BiConsumer> auto foreach_adjacent_values(Container &&c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) { foreach_adjacent_values(c.begin(), c.end(), f); } // ! other utilities // x <- min(x, y). returns true iff `x` has chenged. template <typename T> inline bool chmin(T& x, const T& y) { return y >= x ? false : (x = y, true); } // x <- max(x, y). returns true iff `x` has chenged. template <typename T> inline bool chmax(T& x, const T& y) { return y <= x ? false : (x = y, true); } template <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr> std::string bin(T val, int bit_num = -1) { std::string res; if (bit_num != -1) { for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1); } else { for (; val; val >>= 1) res += '0' + (val & 1); std::reverse(res.begin(), res.end()); } return res; } template <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr> std::vector<T> digits_low_to_high(T val, T base = 10) { std::vector<T> res; for (; val; val /= base) res.push_back(val % base); if (res.empty()) res.push_back(T{ 0 }); return res; } template <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr> std::vector<T> digits_high_to_low(T val, T base = 10) { auto res = digits_low_to_high(val, base); std::reverse(res.begin(), res.end()); return res; } template <typename T> std::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) { std::ostringstream ss; for (auto it = v.begin(); it != v.end();) { ss << *it; if (++it != v.end()) ss << sep; } ss << end; return ss.str(); } template <typename Func, typename Seq> auto transform_to_vector(const Func &f, const Seq &s) { std::vector<std::invoke_result_t<Func, typename Seq::value_type>> v; v.reserve(std::size(s)), std::transform(std::begin(s), std::end(s), std::back_inserter(v), f); return v; } template <typename T, typename Seq> auto copy_to_vector(const Seq &s) { std::vector<T> v; v.reserve(std::size(s)), std::copy(std::begin(s), std::end(s), std::back_inserter(v)); return v; } template <typename Seq> Seq concat(Seq s, const Seq &t) { s.reserve(std::size(s) + std::size(t)); std::copy(std::begin(t), std::end(t), std::back_inserter(s)); return s; } template <typename Seq> std::vector<Seq> split(const Seq s, typename Seq::value_type delim) { std::vector<Seq> res; for (auto itl = std::begin(s), itr = itl;; itl = ++itr) { while (itr != std::end(s) and *itr != delim) ++itr; res.emplace_back(itl, itr); if (itr == std::end(s)) return res; } } int digit_to_int(char c) { return c - '0'; } int lowercase_to_int(char c) { return c - 'a'; } int uppercase_to_int(char c) { return c - 'A'; } std::vector<int> digit_str_to_ints(const std::string &s) { return transform_to_vector(digit_to_int, s); } std::vector<int> lowercase_str_to_ints(const std::string &s) { return transform_to_vector(lowercase_to_int, s); } std::vector<int> uppercase_str_to_ints(const std::string &s) { return transform_to_vector(uppercase_to_int, s); } const std::string Yes = "Yes", No = "No", YES = "YES", NO = "NO"; namespace suisen {} using namespace suisen; using namespace std; struct io_setup { io_setup(int precision = 20) { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(precision); } } io_setup_ {}; // ! code from here #include <atcoder/modint> using mint = atcoder::modint998244353; namespace atcoder { std::istream& operator>>(std::istream& in, mint& a) { long long e; in >> e; a = e; return in; } std::ostream& operator<<(std::ostream& out, const mint& a) { out << a.val(); return out; } } // namespace atcoder mt19937 rng{}; #include <vector> namespace suisen { template <int base_as_int, typename mint> struct static_pow_mods { static_pow_mods() {} static_pow_mods(int n) { ensure(n); } const mint& operator[](int i) const { ensure(i); return pows[i]; } static void ensure(int n) { int sz = pows.size(); if (sz > n) return; pows.resize(n + 1); for (int i = sz; i <= n; ++i) pows[i] = base * pows[i - 1]; } private: static inline std::vector<mint> pows { 1 }; static inline mint base = base_as_int; static constexpr int mod = mint::mod(); }; template <typename mint> struct pow_mods { pow_mods() {} pow_mods(mint base, int n) : base(base) { ensure(n); } const mint& operator[](int i) const { ensure(i); return pows[i]; } void ensure(int n) const { int sz = pows.size(); if (sz > n) return; pows.resize(n + 1); for (int i = sz; i <= n; ++i) pows[i] = base * pows[i - 1]; } private: mutable std::vector<mint> pows { 1 }; mint base; static constexpr int mod = mint::mod(); }; } int main() { int n; string s_; int q; read(n, s_, q); const int m = 1 << n; vector<mint> s(m); REP(i, m) { s[i] = s_[i] - '0'; } pow_mods<mint> pow_2(2, m); pow_mods<mint> pow_11(11, m); auto merge = [&](pair<int, mint> l, pair<int, mint> r) -> pair<int, mint> { auto [ll, sl] = l; auto [lr, sr] = r; return { ll + lr, sl * pow_11[lr] + sr * pow_2[ll] }; }; vector<int> upd(m); vector<vector<pair<mint, int>>> seg(m); { auto init = [&](auto init, int k, int tl, int tr, int bit) -> void { if (tr - tl == 1) { return; } seg[k].resize(tr - tl, { 0, -1 }); int tm = (tl + tr) >> 1; init(init, 2 * k + 0, tl, tm, bit - 1); init(init, 2 * k + 1, tm, tr, bit - 1); }; init(init, 1, 0, m, n); } REP(qi, 1, q + 1) { int qt; read(qt); if (qt == 1) { int x, y; read(x, y); s[x] = y; for (int i = x + m; i >>= 1;) { upd[i] = qi; } } else { int l, r, x; read(l, r, x); ++r; auto query = [&](auto rec, int k, int tl, int bit) -> pair<int, mint> { const int tr = tl + (1 << bit); if (l >= tr or r <= tl) return { 0, 0 }; if (tr - tl == 1) return { 1, s[k - m] }; const int xlo = x & ((1 << bit) - 1); if (l <= tl and tr <= r) { if (seg[k][xlo].second > upd[k]) { return { tr - tl, seg[k][xlo].first }; } } pair<int, mint> ans; int tm = (tl + tr) >> 1; if (kth_bit(x, bit - 1) == 0) { auto sl = rec(rec, 2 * k + 0, tl, bit - 1); auto sr = rec(rec, 2 * k + 1, tm, bit - 1); ans = merge(sl, sr); } else { auto sl = rec(rec, 2 * k + 1, tl, bit - 1); auto sr = rec(rec, 2 * k + 0, tm, bit - 1); ans = merge(sl, sr); } if (l <= tl and tr <= r) { seg[k][xlo] = { ans.second, qi }; } return ans; }; print(query(query, 1, 0, n).second); } } return 0; }