結果

問題 No.2433 Min Increasing Sequence
ユーザー 👑 emthrmemthrm
提出日時 2023-08-18 22:07:12
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 89 ms / 2,000 ms
コード長 8,956 bytes
コンパイル時間 3,445 ms
コンパイル使用メモリ 266,812 KB
実行使用メモリ 10,512 KB
最終ジャッジ日時 2024-11-28 07:22:00
合計ジャッジ時間 5,918 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << fixed << setprecision(20);
}
} iosetup;
template <unsigned int M>
struct MInt {
unsigned int v;
constexpr MInt() : v(0) {}
constexpr MInt(const long long x) : v(x >= 0 ? x % M : x % M + M) {}
static constexpr MInt raw(const int x) {
MInt x_;
x_.v = x;
return x_;
}
static constexpr int get_mod() { return M; }
static constexpr void set_mod(const int divisor) {
assert(std::cmp_equal(divisor, M));
}
static void init(const int x) {
inv<true>(x);
fact(x);
fact_inv(x);
}
template <bool MEMOIZES = false>
static MInt inv(const int n) {
// assert(0 <= n && n < M && std::gcd(n, M) == 1);
static std::vector<MInt> inverse{0, 1};
const int prev = inverse.size();
if (n < prev) return inverse[n];
if constexpr (MEMOIZES) {
// "n!" and "M" must be disjoint.
inverse.resize(n + 1);
for (int i = prev; i <= n; ++i) {
inverse[i] = -inverse[M % i] * raw(M / i);
}
return inverse[n];
}
int u = 1, v = 0;
for (unsigned int a = n, b = M; b;) {
const unsigned int q = a / b;
std::swap(a -= q * b, b);
std::swap(u -= q * v, v);
}
return u;
}
static MInt fact(const int n) {
static std::vector<MInt> factorial{1};
if (const int prev = factorial.size(); n >= prev) {
factorial.resize(n + 1);
for (int i = prev; i <= n; ++i) {
factorial[i] = factorial[i - 1] * i;
}
}
return factorial[n];
}
static MInt fact_inv(const int n) {
static std::vector<MInt> f_inv{1};
if (const int prev = f_inv.size(); n >= prev) {
f_inv.resize(n + 1);
f_inv[n] = inv(fact(n).v);
for (int i = n; i > prev; --i) {
f_inv[i - 1] = f_inv[i] * i;
}
}
return f_inv[n];
}
static MInt nCk(const int n, const int k) {
if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) :
fact_inv(n - k) * fact_inv(k));
}
static MInt nPk(const int n, const int k) {
return n < 0 || n < k || k < 0 ? MInt() : fact(n) * fact_inv(n - k);
}
static MInt nHk(const int n, const int k) {
return n < 0 || k < 0 ? MInt() : (k == 0 ? 1 : nCk(n + k - 1, k));
}
static MInt large_nCk(long long n, const int k) {
if (n < 0 || n < k || k < 0) [[unlikely]] return MInt();
inv<true>(k);
MInt res = 1;
for (int i = 1; i <= k; ++i) {
res *= inv(i) * n--;
}
return res;
}
constexpr MInt pow(long long exponent) const {
MInt res = 1, tmp = *this;
for (; exponent > 0; exponent >>= 1) {
if (exponent & 1) res *= tmp;
tmp *= tmp;
}
return res;
}
constexpr MInt& operator+=(const MInt& x) {
if ((v += x.v) >= M) v -= M;
return *this;
}
constexpr MInt& operator-=(const MInt& x) {
if ((v += M - x.v) >= M) v -= M;
return *this;
}
constexpr MInt& operator*=(const MInt& x) {
v = (unsigned long long){v} * x.v % M;
return *this;
}
MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }
constexpr auto operator<=>(const MInt& x) const = default;
constexpr MInt& operator++() {
if (++v == M) [[unlikely]] v = 0;
return *this;
}
constexpr MInt operator++(int) {
const MInt res = *this;
++*this;
return res;
}
constexpr MInt& operator--() {
v = (v == 0 ? M - 1 : v - 1);
return *this;
}
constexpr MInt operator--(int) {
const MInt res = *this;
--*this;
return res;
}
constexpr MInt operator+() const { return *this; }
constexpr MInt operator-() const { return raw(v ? M - v : 0); }
constexpr MInt operator+(const MInt& x) const { return MInt(*this) += x; }
constexpr MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
constexpr MInt operator*(const MInt& x) const { return MInt(*this) *= x; }
MInt operator/(const MInt& x) const { return MInt(*this) /= x; }
friend std::ostream& operator<<(std::ostream& os, const MInt& x) {
return os << x.v;
}
friend std::istream& operator>>(std::istream& is, MInt& x) {
long long v;
is >> v;
x = MInt(v);
return is;
}
};
using ModInt = MInt<MOD>;
template <typename T>
requires requires {
typename T::Monoid;
{T::id()} -> std::same_as<typename T::Monoid>;
{T::merge(std::declval<typename T::Monoid>(),
std::declval<typename T::Monoid>())}
-> std::same_as<typename T::Monoid>;
}
struct SegmentTree {
using Monoid = typename T::Monoid;
explicit SegmentTree(const int n)
: SegmentTree(std::vector<Monoid>(n, T::id())) {}
explicit SegmentTree(const std::vector<Monoid>& a)
: n(a.size()), p2(std::bit_ceil(a.size())) {
dat.assign(p2 << 1, T::id());
std::copy(a.begin(), a.end(), dat.begin() + p2);
for (int i = p2 - 1; i > 0; --i) {
dat[i] = T::merge(dat[i << 1], dat[(i << 1) + 1]);
}
}
void set(int idx, const Monoid val) {
idx += p2;
dat[idx] = val;
while (idx >>= 1) dat[idx] = T::merge(dat[idx << 1], dat[(idx << 1) + 1]);
}
Monoid get(int left, int right) const {
Monoid res_l = T::id(), res_r = T::id();
for (left += p2, right += p2; left < right; left >>= 1, right >>= 1) {
if (left & 1) res_l = T::merge(res_l, dat[left++]);
if (right & 1) res_r = T::merge(dat[--right], res_r);
}
return T::merge(res_l, res_r);
}
Monoid operator[](const int idx) const { return dat[idx + p2]; }
template <typename G>
int find_right(int left, const G g) const {
if (left >= n) [[unlikely]] return n;
Monoid val = T::id();
left += p2;
do {
while (!(left & 1)) left >>= 1;
Monoid nxt = T::merge(val, dat[left]);
if (!g(nxt)) {
while (left < p2) {
left <<= 1;
nxt = T::merge(val, dat[left]);
if (g(nxt)) {
val = nxt;
++left;
}
}
return left - p2;
}
val = nxt;
++left;
} while (!std::has_single_bit(static_cast<unsigned int>(left)));
return n;
}
template <typename G>
int find_left(int right, const G g) const {
if (right <= 0) [[unlikely]] return -1;
Monoid val = T::id();
right += p2;
do {
--right;
while (right > 1 && (right & 1)) right >>= 1;
Monoid nxt = T::merge(dat[right], val);
if (!g(nxt)) {
while (right < p2) {
right = (right << 1) + 1;
nxt = T::merge(dat[right], val);
if (g(nxt)) {
val = nxt;
--right;
}
}
return right - p2;
}
val = nxt;
} while (!std::has_single_bit(static_cast<unsigned int>(right)));
return -1;
}
private:
const int n, p2;
std::vector<Monoid> dat;
};
namespace monoid {
template <typename T>
struct RangeMinimumQuery {
using Monoid = T;
static constexpr Monoid id() { return std::numeric_limits<Monoid>::max(); }
static Monoid merge(const Monoid& a, const Monoid& b) {
return std::min(a, b);
}
};
template <typename T>
struct RangeMaximumQuery {
using Monoid = T;
static constexpr Monoid id() { return std::numeric_limits<Monoid>::lowest(); }
static Monoid merge(const Monoid& a, const Monoid& b) {
return std::max(a, b);
}
};
template <typename T>
struct RangeSumQuery {
using Monoid = T;
static constexpr Monoid id() { return 0; }
static Monoid merge(const Monoid& a, const Monoid& b) { return a + b; }
};
} // namespace monoid
int main() {
int n; cin >> n;
vector<int> a(n); REP(i, n) cin >> a[i];
vector<int> b = a;
ranges::sort(b);
b.erase(unique(b.begin(), b.end()), b.end());
const int m = b.size();
REP(i, n) a[i] = distance(b.begin(), ranges::lower_bound(b, a[i]));
vector<int> r_min = a;
for (int i = n - 2; i >= 0; --i) chmin(r_min[i], r_min[i + 1]);
SegmentTree<monoid::RangeMaximumQuery<int>> arg(m);
arg.set(a.front(), 0);
SegmentTree<monoid::RangeSumQuery<ModInt>> dp(n);
dp.set(0, 1);
FOR(i, 1, n) {
if (const int l = arg.get(0, r_min[i] + 1); l >= 0) {
dp.set(i, dp.get(0, l + 1));
}
arg.set(a[i], i);
}
cout << dp.get(0, n) << '\n';
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0