結果
| 問題 | No.2369 Some Products |
| ユーザー |
👑  hos.lyric
|
| 提出日時 | 2023-06-30 22:29:38 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 276 ms / 2,500 ms |
| コード長 | 5,467 bytes |
| コンパイル時間 | 937 ms |
| コンパイル使用メモリ | 103,912 KB |
| 実行使用メモリ | 248,704 KB |
| 最終ジャッジ日時 | 2024-07-07 10:20:50 |
| 合計ジャッジ時間 | 2,970 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 14 |
ソースコード
#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 <limits>#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> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i>= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }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>;int N;vector<Mint> P;Mint pool[4 * 5010 * 5010];Mint *ptr = pool;Mint *f[5010][5010];void build(int l, int r) {if (l + 1 < r) {const int mid = (l + r) / 2;f[mid][mid] = ptr; ptr += 1; f[mid][mid][0] = 1;for (int i = mid; --i >= l; ) {f[mid][i] = ptr; ptr += ((mid - i) + 1);for (int j = 0; j <= mid - (i + 1); ++j) {f[mid][i][j] = f[mid][i + 1][j];}f[mid][i][mid - i] = 0;for (int j = 0; j <= mid - (i + 1); ++j) {f[mid][i][j + 1] += f[mid][i + 1][j] * P[i];}}for (int i = mid; i < r; ++i) {f[mid][i + 1] = ptr; ptr += (((i + 1) - mid) + 1);for (int j = 0; j <= i - mid; ++j) {f[mid][i + 1][j] = f[mid][i][j];}f[mid][i + 1][(i + 1) - mid] = 0;for (int j = 0; j <= i - mid; ++j) {f[mid][i + 1][j + 1] += f[mid][i][j] * P[i];}}build(l, mid);build(mid, r);}}int main() {for (; ~scanf("%d", &N); ) {P.resize(N);for (int i = 0; i < N; ++i) {int p;scanf("%d", &p);P[i] = p;}for (int i = 0; i <= N; ++i) for (int j = 0; j <= N; ++j) {f[i][j] = nullptr;}build(0, N);// cerr<<"used "<<(ptr-pool)<<endl;int Q;scanf("%d", &Q);for (; Q--; ) {int L, R, K;scanf("%d%d%d", &L, &R, &K);--L;Mint ans = 0;for (int m = L; m <= R; ++m) {// cerr<<m<<" "<<f[m][L]<<" "<<f[m][R]<<endl;if (f[m][L] && f[m][R]) {for (int k = 0; k <= K; ++k) {if (k <= m - L && K - k <= R - m) {ans += f[m][L][k] * f[m][R][K - k];}}break;}}printf("%u\n", ans.x);}}return 0;}