結果
| 問題 | No.1720 Division Permutation |
| ユーザー |
👑  hos.lyric
|
| 提出日時 | 2021-10-22 21:51:29 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 751 ms / 4,000 ms |
| コード長 | 10,088 bytes |
| コンパイル時間 | 1,220 ms |
| コンパイル使用メモリ | 111,524 KB |
| 実行使用メモリ | 31,712 KB |
| 最終ジャッジ日時 | 2024-09-23 05:17:48 |
| 合計ジャッジ時間 | 28,519 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 60 |
ソースコード
#include <cassert>#include <cmath>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <functional>#include <iostream>#include <map>#include <numeric>#include <queue>#include <set>#include <sstream>#include <string>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using Int = long long;template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }////////////////////////////////////////////////////////////////////////////////template <unsigned M_> struct ModInt {static constexpr unsigned M = M_;unsigned x;constexpr ModInt() : x(0U) {}constexpr ModInt(unsigned x_) : x(x_ % M) {}constexpr ModInt(unsigned long long x_) : x(x_ % M) {}constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }ModInt pow(long long e) const {if (e < 0) return inv().pow(-e);ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;}ModInt inv() const {unsigned a = M, b = x; int y = 0, z = 1;for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }assert(a == 1U); return ModInt(y);}ModInt operator+() const { return *this; }ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }explicit operator bool() const { return x; }bool operator==(const ModInt &a) const { return (x == a.x); }bool operator!=(const ModInt &a) const { return (x != a.x); }friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }};////////////////////////////////////////////////////////////////////////////////constexpr unsigned MO = 998244353;using Mint = ModInt<MO>;// T: monoid representing information of an interval.// T() should return the identity.// T(S s) should represent a single element of the array.// T::push(T &l, T &r) should push the lazy update.// T::merge(const T &l, const T &r) should merge two intervals.template <class T> struct SegmentTreeRange {int logN, n;vector<T> ts;SegmentTreeRange() {}explicit SegmentTreeRange(int n_) {for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}ts.resize(n << 1);}template <class S> explicit SegmentTreeRange(const vector<S> &ss) {const int n_ = ss.size();for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}ts.resize(n << 1);for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);build();}T &at(int i) {return ts[n + i];}void build() {for (int u = n; --u; ) merge(u);}inline void push(int u) {ts[u].push(ts[u << 1], ts[u << 1 | 1]);}inline void merge(int u) {ts[u].merge(ts[u << 1], ts[u << 1 | 1]);}// Applies T::f(args...) to [a, b).template <class F, class... Args>void ch(int a, int b, F f, Args &&... args) {assert(0 <= a); assert(a <= b); assert(b <= n);if (a == b) return;a += n; b += n;for (int h = logN; h; --h) {const int aa = a >> h, bb = b >> h;if (aa == bb) {if ((aa << h) != a || (bb << h) != b) push(aa);} else {if ((aa << h) != a) push(aa);if ((bb << h) != b) push(bb);}}for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {if (aa & 1) (ts[aa++].*f)(args...);if (bb & 1) (ts[--bb].*f)(args...);}for (int h = 1; h <= logN; ++h) {const int aa = a >> h, bb = b >> h;if (aa == bb) {if ((aa << h) != a || (bb << h) != b) merge(aa);} else {if ((aa << h) != a) merge(aa);if ((bb << h) != b) merge(bb);}}}// Calculates T::f(args...) of a monoid type for [a, b).// op(-, -) should calculate the product.// e() should return the identity.template <class Op, class E, class F, class... Args>#if __cplusplus >= 201402Lauto#elsedecltype((std::declval<T>().*F())())#endifget(int a, int b, Op op, E e, F f, Args &&... args) {assert(0 <= a); assert(a <= b); assert(b <= n);if (a == b) return e();a += n; b += n;for (int h = logN; h; --h) {const int aa = a >> h, bb = b >> h;if (aa == bb) {if ((aa << h) != a || (bb << h) != b) push(aa);} else {if ((aa << h) != a) push(aa);if ((bb << h) != b) push(bb);}}auto prodL = e(), prodR = e();for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);}return op(prodL, prodR);}// Find min b s.t. T::f(args...) returns true,// when called for the partition of [a, b) from left to right.// Returns n + 1 if there is no such b.template <class F, class... Args>int findRight(int a, F f, Args &&... args) {assert(0 <= a); assert(a <= n);if ((T().*f)(args...)) return a;if (a == n) return n + 1;a += n;for (int h = logN; h; --h) push(a >> h);for (; ; a >>= 1) {if (a & 1) {if ((ts[a].*f)(args...)) {for (; a < n; ) {push(a);a <<= 1;if (!(ts[a].*f)(args...)) ++a;}return a - n + 1;}++a;if (!(a & (a - 1))) return n + 1;}}}// Find max a s.t. T::f(args...) returns true,// when called for the partition of [a, b) from right to left.// Returns -1 if there is no such a.template <class F, class... Args>int findLeft(int b, F f, Args &&... args) {assert(0 <= b); assert(b <= n);if ((T().*f)(args...)) return b;if (b == 0) return -1;b += n;for (int h = logN; h; --h) push((b - 1) >> h);for (; ; b >>= 1) {if ((b & 1) || b == 2) {if ((ts[b - 1].*f)(args...)) {for (; b <= n; ) {push(b - 1);b <<= 1;if (!(ts[b - 1].*f)(args...)) --b;}return b - n - 1;}--b;if (!(b & (b - 1))) return -1;}}}};////////////////////////////////////////////////////////////////////////////////constexpr int INF = 1001001001;constexpr int MAX_K = 10;int K;struct Node {int mn;Mint sum[MAX_K + 1];int lz;Node() : mn(INF), sum{}, lz(0) {}void push(Node &l, Node &r) {l.add(lz);r.add(lz);lz = 0;}void merge(const Node &l, const Node &r) {mn = min(l.mn, r.mn);for (int k = 0; k <= K; ++k) {sum[k] = 0;if (mn == l.mn) sum[k] += l.sum[k];if (mn == r.mn) sum[k] += r.sum[k];}}void add(long long val) {mn += val;lz += val;}void addCnt(const Node &val) {for (int k = 0; k < K; ++k) {sum[k + 1] += val.sum[k];}}Node get() const {return *this;}};Node get(SegmentTreeRange<Node> &seg, int a, int b) {return seg.get(a, b,[&](const Node &l, const Node &r) -> Node { Node ret; ret.merge(l, r); return ret; },[&]() -> Node { return Node(); },&Node::get);}int N;vector<int> P;int main() {for (; ~scanf("%d%d", &N, &K); ) {P.resize(N);for (int i = 0; i < N; ++i) {scanf("%d", &P[i]);}// (max - min) - (right - left)SegmentTreeRange<Node> seg(N + 1);for (int i = 0; i <= N; ++i) {seg.at(i).mn = 0;}seg.at(0).sum[0] = 1;seg.build();vector<int> dn{-1}, up{-1};for (int i = 0; i < N; ++i) {for (; ; ) {const int j = dn.back();if (!~j || P[j] > P[i]) break;dn.pop_back();// cerr<<"dn ("<<dn.back()<<", "<<j<<"] "<<P[i]-P[j]<<endl;seg.ch(dn.back() + 1, j + 1, &Node::add, P[i] - P[j]);}dn.push_back(i);for (; ; ) {const int j = up.back();if (!~j || P[j] < P[i]) break;up.pop_back();// cerr<<"up ("<<up.back()<<", "<<j<<"] "<<P[j]-P[i]<<endl;seg.ch(up.back() + 1, j + 1, &Node::add, P[j] - P[i]);}up.push_back(i);seg.ch(0, i, &Node::add, -1);const Node res = get(seg, 0, i + 1);// cerr<<i<<": "<<res.mn<<"; ";pv(res.sum,res.sum+K+1);if (res.mn == 0) {seg.ch(i + 1, i + 2, &Node::addCnt, res);}}const Node ans = get(seg, N, N + 1);for (int k = 1; k <= K; ++k) {printf("%u\n", ans.sum[k].x);}}return 0;}