結果
問題 | No.1548 [Cherry 2nd Tune B] 貴方と私とサイクルとモーメント |
ユーザー |
![]() |
提出日時 | 2021-06-11 23:14:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 720 ms / 4,500 ms |
コード長 | 8,897 bytes |
コンパイル時間 | 4,522 ms |
コンパイル使用メモリ | 222,524 KB |
最終ジャッジ日時 | 2025-01-22 07:00:40 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 42 |
ソースコード
/*#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//*/#include <bits/stdc++.h>// #include <atcoder/all>using namespace std;// using namespace atcoder;#define DEBUG(x) cerr << #x << ": " << x << endl;#define DEBUG_VEC(v) \cerr << #v << ":"; \for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \cerr << " " << v[iiiiiiii]; \cerr << endl;#define DEBUG_MAT(v) \cerr << #v << endl; \for (int i = 0; i < v.size(); i++) { \for (int j = 0; j < v[i].size(); j++) { \cerr << v[i][j] << " "; \} \cerr << endl; \}typedef long long ll;// #define int ll#define vi vector<int>#define vl vector<ll>#define vii vector<vector<int>>#define vll vector<vector<ll>>#define vs vector<string>#define pii pair<int, int>#define pis pair<int, string>#define psi pair<string, int>#define pll pair<ll, ll>template <class S, class T>pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {return pair<S, T>(s.first + t.first, s.second + t.second);}template <class S, class T>pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template <class S, class T>ostream &operator<<(ostream &os, pair<S, T> p) {os << "(" << p.first << ", " << p.second << ")";return os;}#define X first#define Y second#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)#define REP(i, a, b) for (int i = a; i < b; i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(), c.end()void YES(bool t = true) {cout << (t ? "YES" : "NO") << endl;}void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }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 (a > b) {a = b;return 1;}return 0;}#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;int popcount(ll t) { return __builtin_popcountll(t); }// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(25);}} setup_io;// const ll MOD = 1000000007;const ll MOD = 998244353;// #define mp make_pair//#define endl '\n'template <typename T1, typename T2>class LazySegmentTree {public:using F = function<T1(T1 &, T1 &)>; // query_funcusing G = function<T2(T2 &, T2 &)>; // update_funcusing H = function<T1(T1 &, T2 &, int, int)>; // lazy to node (node, lazy, left, right)int n;vector<T1> node;vector<T2> lazy;T1 e1;T2 e2;F query_func;G update_func;H eval_func;LazySegmentTree(vector<T1> a, F query_func, G update_func, H eval_func, T1 e1, T2 e2): query_func(query_func), update_func(update_func), eval_func(eval_func), e1(e1), e2(e2) {int _n = a.size();n = 1;while (n < _n)n *= 2;node.resize(2 * n - 1, e1);lazy.resize(2 * n - 1, e2);for (int i = 0; i < _n; i++)node[i + n - 1] = a[i];for (int i = n - 2; i >= 0; i--) {node[i] = query_func(node[i * 2 + 1], node[i * 2 + 2]);}}// k�Ԗڂ̃m�[�h�ɂ·��Ēx���]�����s��inline void eval(int k, int l, int r) {if (lazy[k] != e2) { // Changenode[k] = eval_func(node[k], lazy[k], l, r);if (r - l > 1) {lazy[2 * k + 1] = update_func(lazy[2 * k + 1], lazy[k]);lazy[2 * k + 2] = update_func(lazy[2 * k + 2], lazy[k]);}lazy[k] = e2; // Change}}// [a, b)��x�ɂ���void update(int a, int b, T2 x, int k, int l, int r) {// k �Ԗڂ̃m�[�h�ɑ��Ēx���]�����s��eval(k, l, r);if (b <= l || r <= a) return;if (a <= l && r <= b) {lazy[k] = update_func(lazy[k], x);eval(k, l, r);} else {update(a, b, x, 2 * k + 1, l, (l + r) / 2);update(a, b, x, 2 * k + 2, (l + r) / 2, r);node[k] = query_func(node[2 * k + 1], node[2 * k + 2]);}}T1 query(int a, int b, int k, int l, int r) {eval(k, l, r);if (b <= l || r <= a) return e1;if (a <= l && r <= b) return node[k];T1 resl = query(a, b, 2 * k + 1, l, (l + r) / 2);T1 resr = query(a, b, 2 * k + 2, (l + r) / 2, r);return query_func(resl, resr);}};const int MAXN = 555555;vl fact(MAXN);vl rfact(MAXN);ll mod_pow(ll x, ll p, ll M = MOD) {if (p < 0) {x = mod_pow(x, M - 2, M);p = -p;}ll a = 1;while (p) {if (p % 2)a = a * x % M;x = x * x % M;p /= 2;}return a;}ll mod_inverse(ll a, ll M = MOD) {return mod_pow(a, M - 2, M);}void set_fact(ll n, ll M = MOD) {fact[0] = 1;for (ll i = 1; i <= n; i++) {fact[i] = i * fact[i - 1] % M;}rfact[n] = mod_inverse(fact[n], M);for (ll i = n - 1; i >= 0; i--) {rfact[i] = (i + 1) * rfact[i + 1] % M;}}//http://drken1215.hatenablog.com/entry/2018/06/08/210000//n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ·��ď����Ă���ll nCr(ll n, ll r, ll M = MOD) {if (r > n) return 0;assert(fact[2] == 2);ll ret = fact[n];if (rfact[r] == 0) {rfact[r] = mod_inverse(fact[r], M);}ret = (ret * rfact[r]) % M;if (rfact[n - r] == 0) {rfact[n - r] = mod_inverse(fact[n - r], M);}ret = (ret * rfact[n - r]) % M;return ret;}ll nHr(ll n, ll r) {return nCr(n + r - 1, r);}ll f(ll a, ll b) {return (a + b) % MOD;}ll g(ll a, ll b) {return b;}ll h(ll a, ll b, int l, int r) {return b * (r - l) % MOD;}signed main() {int n;cin >> n;vl a(n);rep(i, n) {cin >> a[i];}vector<LazySegmentTree<ll, ll>> seg;vl now(n, 1);for (int i = 0; i <= 4; i++) {LazySegmentTree<ll, ll> sseg(now, f, g, h, 0, -INF);seg.push_back(sseg);rep(i, n) {(now[i] *= a[i]) %= MOD;}}vll kei = {{},{-1, 1},{1, -2, 1},{-1, 3, -3, 1},{1, -4, 6, -4, 1}};int q;cin >> q;while (q--) {ll t, u, v, w;cin >> t >> u >> v >> w;u--;v--;w--;if (u > v) swap(u, v);vector<pii> op;if ((w - u) * (w - v) < 0) {op.emplace_back(u, v + 1);} else {op.emplace_back(v, n);op.emplace_back(0, u + 1);}if (t == 0) {ll b;cin >> b;ll now = 1;rep(i, 5) {for (auto [l, r] : op) {seg[i].update(l, r, now, 0, 0, seg[i].n);}now = now * b % MOD;}continue;}ll len = 0;ll sum = 0;for (auto [l, r] : op) {sum += seg[1].query(l, r, 0, 0, seg[1].n);len += (r - l);}sum %= MOD;ll m = sum * mod_inverse(len) % MOD;ll ans = 0;ll mm = 1;rrep(i, kei[t].size()) {ll s = 0;for (auto [l, r] : op) {s += seg[i].query(l, r, 0, 0, seg[i].n);}s %= MOD;s *= mm * kei[t][i] % MOD;ans += s % MOD;mm = mm * m % MOD;}ans %= MOD;ans *= mod_inverse(len);cout << (ans % MOD + MOD) % MOD << endl;}}