結果
問題 | No.1294 マウンテン数列 |
ユーザー |
![]() |
提出日時 | 2020-11-21 01:22:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 222 ms / 2,000 ms |
コード長 | 6,352 bytes |
コンパイル時間 | 2,272 ms |
コンパイル使用メモリ | 198,408 KB |
最終ジャッジ日時 | 2025-01-16 03:41:31 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 17 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define REP(i, n) FOR(i,0,n)template <int mod> struct ModInt {#if __cplusplus >= 201402L#define MDCONST constexpr#else#define MDCONST#endifusing lint = long long;static int get_mod() { return mod; }static int get_primitive_root() {static int primitive_root = 0;if (!primitive_root) {primitive_root = [&]() {std::set<int> fac;int v = mod - 1;for (lint i = 2; i * i <= v; i++)while (v % i == 0) fac.insert(i), v /= i;if (v > 1) fac.insert(v);for (int g = 1; g < mod; g++) {bool ok = true;for (auto i : fac)if (ModInt(g).power((mod - 1) / i) == 1) {ok = false;break;}if (ok) return g;}return -1;}();}return primitive_root;}int val;MDCONST ModInt() : val(0) {}MDCONST ModInt &_setval(lint v) {val = (v >= mod ? v - mod : v);return *this;}MDCONST ModInt(lint v) { _setval(v % mod + mod); }explicit operator bool() const { return val != 0; }MDCONST ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); }MDCONST ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); }MDCONST ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); }MDCONST ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); }MDCONST ModInt operator-() const { return ModInt()._setval(mod - val); }MDCONST ModInt &operator+=(const ModInt &x) { return *this = *this + x; }MDCONST ModInt &operator-=(const ModInt &x) { return *this = *this - x; }MDCONST ModInt &operator*=(const ModInt &x) { return *this = *this * x; }MDCONST ModInt &operator/=(const ModInt &x) { return *this = *this / x; }friend MDCONST ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); }friend MDCONST ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); }friend MDCONST ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); }friend MDCONST ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); }MDCONST bool operator==(const ModInt &x) const { return val == x.val; }MDCONST bool operator!=(const ModInt &x) const { return val != x.val; }MDCONST bool operator<(const ModInt &x) const { return val < x.val; } // To use std::map<ModInt, T>friend std::istream &operator>>(std::istream &is, ModInt &x) {lint t;return is >> t, x = ModInt(t), is;}MDCONST friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { return os << x.val; }MDCONST lint power(lint n) const {lint ans = 1, tmp = this->val;while (n) {if (n & 1) ans = ans * tmp % mod;tmp = tmp * tmp % mod, n /= 2;}return ans;}MDCONST ModInt pow(lint n) const { return power(n); }MDCONST lint inv() const { return this->power(mod - 2); }ModInt fac() const {static std::vector<ModInt> facs;int l0 = facs.size();if (l0 > this->val) return facs[this->val];facs.resize(this->val + 1);for (int i = l0; i <= this->val; i++) facs[i] = (i == 0 ? ModInt(1) : facs[i - 1] * ModInt(i));return facs[this->val];}ModInt doublefac() const {lint k = (this->val + 1) / 2;return (this->val & 1) ? ModInt(k * 2).fac() / (ModInt(2).pow(k) * ModInt(k).fac()) : ModInt(k).fac() * ModInt(2).pow(k);}ModInt nCr(const ModInt &r) const { return (this->val < r.val) ? 0 : this->fac() / ((*this - r).fac() * r.fac()); }ModInt sqrt() const {if (val == 0) return 0;if (mod == 2) return val;if (power((mod - 1) / 2) != 1) return 0;ModInt b = 1;while (b.power((mod - 1) / 2) == 1) b += 1;int e = 0, m = mod - 1;while (m % 2 == 0) m >>= 1, e++;ModInt x = power((m - 1) / 2), y = (*this) * x * x;x *= (*this);ModInt z = b.power(m);while (y != 1) {int j = 0;ModInt t = y;while (t != 1) j++, t *= t;z = z.power(1LL << (e - j - 1));x *= z, z *= z, y *= z;e = j;}return ModInt(std::min(x.val, mod - x.val));}};using mint = ModInt<998244353>;// 1-indexed BIT (i : [1, len])template <typename T> struct BIT : std::vector<T> {BIT(int len = 0) : std::vector<T>(len + 1) {}void reset() { fill(this->begin(), this->end(), 0); }void add(int pos, T v) {while (pos > 0 and pos < (int)this->size()) (*this)[pos] += v, pos += pos & -pos;}T sum(int pos) const { // (0, pos]T res = 0;while (pos > 0) res += (*this)[pos], pos -= pos & -pos;return res;}friend std::ostream &operator<<(std::ostream &os, const BIT &bit) {T prv = 0;os << '[';for (int i = 1; i < (int)bit.size(); i++) {T now = bit.sum(i);os << now - prv << ",";prv = now;}return os << ']';}};int main(){cin.tie(nullptr), ios::sync_with_stdio(false);int N;cin >> N;vector<int> A(N);for (auto &x : A) cin >> x;const int Amax = A.back();const mint p2 = mint(2).pow(N - 1);int dlo = 0;REP(i, N - 1) dlo = max(dlo, A[i + 1] - A[i]);mint ret = p2 * dlo;reverse(A.begin(), A.end());FOR(d, dlo, Amax) {BIT<mint> bit(Amax);bit.add(A[0], 2);int aprv = A[1];for (auto a : A) {if (a < A[1]) {mint apadd = bit.sum(min(a + d, Amax));bit.add(aprv, apadd);aprv = a;}}ret += (p2 - bit.sum(Amax));}cout << ret << '\n';}