#827557 (C++17) No.2170 Left Addition Machine

• 問題: No.2170 Left Addition Machine
• ユーザー: t33f
• 提出日時: 2022-12-22 08:44:29
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 619 ms / 2,000 ms
• コード長: 3,229 bytes
• コンパイル時間: 3,597 ms
• コンパイル使用メモリ: 88,256 KB
• 実行使用メモリ: 5,760 KB
• 最終ジャッジ日時: 2024-04-29 05:26:33
• 合計ジャッジ時間: 43,954 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	538 ms; 5,504 KB
testcase_04	AC	253 ms; 5,376 KB
testcase_05	AC	352 ms; 5,376 KB
testcase_06	AC	331 ms; 5,376 KB
testcase_07	AC	510 ms; 5,376 KB
testcase_08	AC	58 ms; 5,376 KB
testcase_09	AC	445 ms; 5,376 KB
testcase_10	AC	69 ms; 5,376 KB
testcase_11	AC	249 ms; 5,376 KB
testcase_12	AC	592 ms; 5,504 KB
testcase_13	AC	595 ms; 5,504 KB
testcase_14	AC	599 ms; 5,504 KB
testcase_15	AC	591 ms; 5,632 KB
testcase_16	AC	595 ms; 5,504 KB
testcase_17	AC	596 ms; 5,632 KB
testcase_18	AC	597 ms; 5,504 KB
testcase_19	AC	591 ms; 5,376 KB
testcase_20	AC	600 ms; 5,504 KB
testcase_21	AC	430 ms; 5,376 KB
testcase_22	AC	432 ms; 5,376 KB
testcase_23	AC	431 ms; 5,376 KB
testcase_24	AC	425 ms; 5,376 KB
testcase_25	AC	432 ms; 5,376 KB
testcase_26	AC	427 ms; 5,376 KB
testcase_27	AC	435 ms; 5,376 KB
testcase_28	AC	437 ms; 5,376 KB
testcase_29	AC	429 ms; 5,376 KB
testcase_30	AC	609 ms; 5,504 KB
testcase_31	AC	606 ms; 5,632 KB
testcase_32	AC	608 ms; 5,504 KB
testcase_33	AC	619 ms; 5,504 KB
testcase_34	AC	608 ms; 5,504 KB
testcase_35	AC	605 ms; 5,504 KB
testcase_36	AC	605 ms; 5,504 KB
testcase_37	AC	602 ms; 5,504 KB
testcase_38	AC	612 ms; 5,504 KB
testcase_39	AC	428 ms; 5,376 KB
testcase_40	AC	430 ms; 5,376 KB
testcase_41	AC	426 ms; 5,376 KB
testcase_42	AC	423 ms; 5,376 KB
testcase_43	AC	430 ms; 5,376 KB
testcase_44	AC	428 ms; 5,376 KB
testcase_45	AC	424 ms; 5,376 KB
testcase_46	AC	446 ms; 5,376 KB
testcase_47	AC	423 ms; 5,376 KB
testcase_48	AC	591 ms; 5,504 KB
testcase_49	AC	595 ms; 5,632 KB
testcase_50	AC	599 ms; 5,504 KB
testcase_51	AC	582 ms; 5,376 KB
testcase_52	AC	587 ms; 5,760 KB
testcase_53	AC	571 ms; 5,504 KB
testcase_54	AC	588 ms; 5,376 KB
testcase_55	AC	602 ms; 5,504 KB
testcase_56	AC	606 ms; 5,504 KB
testcase_57	AC	590 ms; 5,504 KB
testcase_58	AC	585 ms; 5,632 KB
testcase_59	AC	597 ms; 5,632 KB
testcase_60	AC	596 ms; 5,504 KB
testcase_61	AC	587 ms; 5,504 KB
testcase_62	AC	599 ms; 5,504 KB
testcase_63	AC	593 ms; 5,504 KB
testcase_64	AC	596 ms; 5,632 KB
testcase_65	AC	597 ms; 5,504 KB
testcase_66	AC	130 ms; 5,376 KB
testcase_67	AC	538 ms; 5,504 KB
testcase_68	AC	587 ms; 5,760 KB

ソースコード

#include <cmath>
#include <vector>
#include <iostream>
using namespace std;

template<int mod>
class modint {
    int val = 0;
    constexpr static int normalize(long long x) {
        if (0 <= x and x < mod) return static_cast<int>(x);
        else { x %= mod; return static_cast<int>(x >= 0 ? x : x + mod); }
    }
public:
    static const int modulus = mod;
    modint() {}
    constexpr modint(long long n) : val(normalize(n)) {}
    constexpr int value() const { return val; }
    constexpr modint operator-() const { return modint(mod - val); }
    constexpr modint inverse() const {
        long long x = mod, y = val, p = 1, q = 0, r = 0, s = 1;
        while (y != 0) {
            long long u = x / y;
            long long x0 = y; y = x - y * u; x = x0;
            long long r0 = p - r * u, s0 = q - s * u;
            p = r; r = r0; q = s; s = s0;
        }
        return modint(q);
    }
    constexpr const modint pow(long long e) const {
        if (e < 0) return pow(-e).inverse();
        long long ans = 1, p = val;
        while (e > 0) {
            if (e % 2 != 0) ans = (ans * p) % mod;
            p = (p * p) % mod;
            e >>= 1;
        }
        return modint(ans);
    }
    constexpr modint &operator+=(const modint r) {
        val += r.value();
        if (val >= mod) val -= mod;
        return *this;
    }
    constexpr modint &operator-=(const modint r) {
        val -= r.value();
        if (val < 0) val += mod;
        return *this;
    }
    constexpr modint &operator*=(const modint r) {
        val = (long long)val * r.value() % mod;
        return *this;
    }
    constexpr modint &operator/=(const modint r) {
        if (r.value() == 2) {
            val = (val % 2 ? val + mod : val) / 2;
        } else {
            val = (long long)val * r.inverse().value() % mod;
        }
        return *this;
    }

    friend constexpr modint operator+(const modint l, const modint r) {
        const int newval = l.value() + r.value();
        return newval >= mod ? newval - mod : newval;
    }
    friend constexpr modint operator-(const modint l, const modint r) { return l + (- r); }
    friend constexpr modint operator*(const modint l, const modint r) { return (long long)l.value() * r.value(); }
    friend constexpr modint operator/(const modint l, const modint r) { return l * r.inverse(); }
    friend constexpr bool operator==(const modint l, const modint r) { return l.value() == r.value(); }
    friend constexpr bool operator!=(const modint l, const modint r) { return l.value() != r.value(); }
};

constexpr int M = 998244353;
using mint = modint<M>;

int main() {
    int n, q; cin >> n >> q;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    vector<int> start_pos(n);
    for (int i = 0, j = 0; i < n; ++i) {
        if (i > 0 && a[i - 1] >= a[i]) j = i;
        start_pos[i] = j;
    }

    vector<mint> sum(n);
    mint p = 1;
    for (int i = 0; i < n; ++i) {
        sum[i] = (i > 0 ? sum[i - 1] : 0) + a[i] * p;
        p *= 2;
    }

    while (q--) {
        int l, r; cin >> l >> r;
        l--; r--;
        const int m = max(l, start_pos[r]);
        cout << (a[m] + mint(2).pow(-m-1) * (sum[r] - sum[m])).value() << endl;
    }
}