結果
問題 | No.2395 区間二次変換一点取得 |
ユーザー |
![]() |
提出日時 | 2023-07-28 21:49:37 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,871 bytes |
コンパイル時間 | 3,445 ms |
コンパイル使用メモリ | 267,304 KB |
実行使用メモリ | 23,132 KB |
最終ジャッジ日時 | 2024-10-06 18:24:50 |
合計ジャッジ時間 | 20,646 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 15 TLE * 5 |
ソースコード
#if __INCLUDE_LEVEL__ == 0#include <bits/stdc++.h>using namespace std;#include __BASE_FILE__namespace {using Mint = atcoder::modint;using S = array<Mint, 5>;S op(S x, S y) {S z;for (int i : rep(5)) {z[i] = x[i] + y[i];}return z;}S e() { return {}; }using F = array<array<Mint, 5>, 5>;S mapping(F f, S x) {S y{};for (int i : rep(5)) {for (int j : rep(5)) {y[i] += f[i][j] * x[j];}}return y;}F composition(F g, F f) {F ret{};for (int i : rep(5)) {for (int k : rep(5)) {if (f[i][k].val() == 0) {continue;}for (int j : rep(5)) {ret[i][j] += f[i][k] * g[k][j];}}}return ret;}F id() {F ret{};for (int i : rep(5)) {ret[i][i] = 1;}return ret;}using Seg = atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>;void solve() {int n, b, q;cin >> tie(n, b, q);Mint::set_mod(b);Seg seg(vector<S>(n, {1, 1, 1, 1, 1}));F f;f[0] = {1, 0, 0, 0, 1};f[1] = {0, 3, 2, 2, 0};f[2] = {0, 0, 3, 0, 0};f[3] = {0, 0, 3, 3, 0};f[4] = {0, 0, 0, 0, 1};while (q--) {int l, m, r;cin >> tie(l, m, r);--l, --m;seg.apply(l, r, f);auto e = seg.get(m);print(e[0], e[1], e[2]);}}} // namespaceint main() {ios::sync_with_stdio(false);cin.tie(nullptr);solve();}#else // __INCLUDE_LEVEL__#undef assert#define assert(expr) (expr) || (__builtin_unreachable(), 0)#include <atcoder/lazysegtree>#include <atcoder/modint>template <class T, class U = T>bool chmin(T& x, U&& y) {return y < x && (x = forward<U>(y), true);}template <class T, class U = T>bool chmax(T& x, U&& y) {return x < y && (x = forward<U>(y), true);}namespace std {template <class T1, class T2>istream& operator>>(istream& is, pair<T1, T2>& p) {return is >> p.first >> p.second;}template <class... Ts>istream& operator>>(istream& is, tuple<Ts...>& t) {return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);}template <class... Ts>istream& operator>>(istream& is, tuple<Ts&...>&& t) {return is >> t;}template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {for (auto&& e : r) {is >> e;}return is;}template <class T1, class T2>ostream& operator<<(ostream& os, const pair<T1, T2>& p) {return os << p.first << ' ' << p.second;}template <class... Ts>ostream& operator<<(ostream& os, const tuple<Ts...>& t) {auto f = [&os](const auto&... xs) -> ostream& {[[maybe_unused]] auto sep = "";((os << exchange(sep, " ") << xs), ...);return os;};return apply(f, t);}template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {auto sep = "";for (auto&& e : r) {os << exchange(sep, " ") << e;}return os;}} // namespace stdnamespace atcoder {template <class T, internal::is_modint_t<T>* = nullptr>istream& operator>>(istream& is, T& x) {int v;is >> v;x = T::raw(v);return is;}template <class T, internal::is_modint_t<T>* = nullptr>ostream& operator<<(ostream& os, const T& x) {return os << x.val();}} // namespace atcodertemplate <class... Ts>void print(Ts&&... xs) {cout << tie(xs...) << '\n';}inline auto rep(int l, int r) { return views::iota(min(l, r), r); }inline auto rep(int n) { return rep(0, n); }inline auto rep1(int l, int r) { return rep(l, r + 1); }inline auto rep1(int n) { return rep(1, n + 1); }inline auto per(int l, int r) { return rep(l, r) | views::reverse; }inline auto per(int n) { return per(0, n); }inline auto per1(int l, int r) { return per(l, r + 1); }inline auto per1(int n) { return per(1, n + 1); }#endif // __INCLUDE_LEVEL__