結果

問題 No.2950 Max Min Product
ユーザー apricityapricity
提出日時 2024-11-24 20:17:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 609 ms / 3,000 ms
コード長 8,692 bytes
コンパイル時間 1,704 ms
コンパイル使用メモリ 151,140 KB
実行使用メモリ 33,176 KB
最終ジャッジ日時 2024-11-24 20:17:53
合計ジャッジ時間 22,803 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 331 ms
30,172 KB
testcase_04 AC 336 ms
30,848 KB
testcase_05 AC 314 ms
30,336 KB
testcase_06 AC 445 ms
33,152 KB
testcase_07 AC 464 ms
33,152 KB
testcase_08 AC 439 ms
33,152 KB
testcase_09 AC 211 ms
18,264 KB
testcase_10 AC 405 ms
32,000 KB
testcase_11 AC 330 ms
30,848 KB
testcase_12 AC 440 ms
33,152 KB
testcase_13 AC 461 ms
33,152 KB
testcase_14 AC 437 ms
33,136 KB
testcase_15 AC 473 ms
32,540 KB
testcase_16 AC 372 ms
30,088 KB
testcase_17 AC 380 ms
30,736 KB
testcase_18 AC 502 ms
33,140 KB
testcase_19 AC 488 ms
33,176 KB
testcase_20 AC 505 ms
33,148 KB
testcase_21 AC 275 ms
18,732 KB
testcase_22 AC 323 ms
30,272 KB
testcase_23 AC 214 ms
18,020 KB
testcase_24 AC 423 ms
32,340 KB
testcase_25 AC 470 ms
32,312 KB
testcase_26 AC 422 ms
32,376 KB
testcase_27 AC 375 ms
29,292 KB
testcase_28 AC 586 ms
31,876 KB
testcase_29 AC 411 ms
29,908 KB
testcase_30 AC 608 ms
32,008 KB
testcase_31 AC 523 ms
32,264 KB
testcase_32 AC 609 ms
31,764 KB
testcase_33 AC 460 ms
29,496 KB
testcase_34 AC 263 ms
17,380 KB
testcase_35 AC 435 ms
29,296 KB
testcase_36 AC 559 ms
31,516 KB
testcase_37 AC 580 ms
31,508 KB
testcase_38 AC 552 ms
31,580 KB
testcase_39 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep1(a)          for(int i = 0; i < a; i++)
#define rep2(i, a)       for(int i = 0; i < a; i++)
#define rep3(i, a, b)    for(int i = a; i < b; i++)
#define rep4(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a)          for(int i = (a)-1; i >= 0; i--)
#define rrep2(i, a)       for(int i = (a)-1; i >= 0; i--)
#define rrep3(i, a, b)    for(int i = (b)-1; i >= a; i--)
#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using vvvvvc = vector<vvvvc<T>>;
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

template <uint32_t mod>
struct LazyMontgomeryModInt {
    using mint = LazyMontgomeryModInt;
    using i32 = int32_t;
    using u32 = uint32_t;
    using u64 = uint64_t;

    static constexpr u32 get_r() {
        u32 ret = mod;
        for (i32 i = 0; i < 4; ++i) ret *= 2 - mod * ret;
        return ret;
    }

    static constexpr u32 r = get_r();
    static constexpr u32 n2 = -u64(mod) % mod;
    static_assert(mod < (1 << 30), "invalid, mod >= 2 ^ 30");
    static_assert((mod & 1) == 1, "invalid, mod % 2 == 0");
    static_assert(r * mod == 1, "this code has bugs.");

    u32 a;

    constexpr LazyMontgomeryModInt() : a(0) {}
    constexpr LazyMontgomeryModInt(const int64_t &b)
    : a(reduce(u64(b % mod + mod) * n2)){};

    static constexpr u32 reduce(const u64 &b) {
        return (b + u64(u32(b) * u32(-r)) * mod) >> 32;
    }

    constexpr mint &operator+=(const mint &b) {
        if (i32(a += b.a - 2 * mod) < 0) a += 2 * mod;
        return *this;
    }

    constexpr mint &operator-=(const mint &b) {
        if (i32(a -= b.a) < 0) a += 2 * mod;
        return *this;
    }

    constexpr mint &operator*=(const mint &b) {
        a = reduce(u64(a) * b.a);
        return *this;
    }

    constexpr mint &operator/=(const mint &b) {
        *this *= b.inverse();
        return *this;
    }

    constexpr mint operator+(const mint &b) const { return mint(*this) += b; }
    constexpr mint operator-(const mint &b) const { return mint(*this) -= b; }
    constexpr mint operator*(const mint &b) const { return mint(*this) *= b; }
    constexpr mint operator/(const mint &b) const { return mint(*this) /= b; }
    constexpr bool operator==(const mint &b) const {
        return (a >= mod ? a - mod : a) == (b.a >= mod ? b.a - mod : b.a);
    }
    constexpr bool operator!=(const mint &b) const {
        return (a >= mod ? a - mod : a) != (b.a >= mod ? b.a - mod : b.a);
    }
    constexpr mint operator-() const { return mint() - mint(*this); }
    constexpr mint operator+() const { return mint(*this); }

    constexpr mint pow(u64 n) const {
        mint ret(1), mul(*this);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    constexpr mint inverse() const {
        int x = get(), y = mod, u = 1, v = 0, t = 0, tmp = 0;
        while (y > 0) {
            t = x / y;
            x -= t * y, u -= t * v;
            tmp = x, x = y, y = tmp;
            tmp = u, u = v, v = tmp;
        }
        return mint{u};
    }

    friend ostream &operator<<(ostream &os, const mint &b) {
        return os << b.get();
    }

    friend istream &operator>>(istream &is, mint &b) {
        int64_t t;
        is >> t;
        b = LazyMontgomeryModInt<mod>(t);
        return (is);
    }

    constexpr u32 get() const {
        u32 ret = reduce(a);
        return ret >= mod ? ret - mod : ret;
    }

    static constexpr u32 get_mod() { return mod; }
};
const int mod = 998244353;
//const int mod = 1000000007;
using mint = LazyMontgomeryModInt<mod>;

#include "atcoder/lazysegtree.hpp"

const ll INF = -1e18;

struct S{
    int len; ll sl, sr; mint slr;
};

struct F{
    ll lv, rv;
};

S op(S a, S b) { return {a.len+b.len, a.sl+b.sl, a.sr+b.sr, a.slr+b.slr}; }

S e() { return {0,0,0,0}; }

S mapping(F f, S x) {
    if (f.lv == INF and f.rv == INF) return x;
    else if (f.lv == INF) return {x.len, x.sl, x.len*f.rv, mint(f.rv) * x.sl};
    else if (f.rv == INF) return {x.len, x.len*f.lv, x.sr, mint(f.lv) * x.sr};
    else return {x.len, x.len*f.lv, x.len*f.rv, mint(x.len) * f.lv * f.rv};
}

F composition(F f, F g) {
    ll nl = (f.lv == INF ? g.lv : f.lv);
    ll nr = (f.rv == INF ? g.rv : f.rv);
    return {nl, nr};
}

F id() { return {INF, INF}; }

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; in(n);
    vector<ll> a(n); in(a);

    vector<S> init(n, {1,0,0,0});
    atcoder::lazy_segtree<S,op,e,F,mapping,composition,id> seg(init);
    mint ans = a[0] * a[0];
    seg.set(0, {1, a[0], a[0], a[0]*a[0]});

    stack<P> stkl, stkr;
    stkl.emplace(a[0],0);
    stkr.emplace(a[0],0);

    rep(j,1,n){
        while(!stkl.empty() and stkl.top().first > a[j]) stkl.pop();
        while(!stkr.empty() and stkr.top().first < a[j]) stkr.pop();
        if(a[j-1] > a[j]) {
            int i = stkl.empty() ? 0 : stkl.top().second + 1;
            ans += seg.prod(0,j).slr;
            auto spre = seg.prod(i,j);
            ans -= spre.slr;
            ans += mint(a[j]) * spre.sr;
            seg.apply(i,j, {a[j],INF});
        }
        else{
            int i = stkr.empty() ? 0 : stkr.top().second + 1;
            ans += seg.prod(0,j).slr;
            auto spre = seg.prod(i,j);
            ans -= spre.slr;
            ans += mint(a[j]) * spre.sl;
            seg.apply(i,j, {INF,a[j]});
        }
        stkl.emplace(a[j], j);
        stkr.emplace(a[j], j);
        ans += a[j] * a[j];
        seg.set(j,{1,a[j], a[j], a[j]*a[j]});
    }
    out(ans);
}
0