結果
問題 |
No.3227 Matrix Query
|
ユーザー |
|
提出日時 | 2025-08-08 21:47:55 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 469 ms / 8,000 ms |
コード長 | 8,724 bytes |
コンパイル時間 | 2,421 ms |
コンパイル使用メモリ | 211,052 KB |
実行使用メモリ | 7,720 KB |
最終ジャッジ日時 | 2025-08-08 21:48:09 |
合計ジャッジ時間 | 12,696 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 28 |
ソースコード
#include <bits/stdc++.h> using namespace std; //入力が必ず-mod<a<modの時. template<int idx> //modが入力で与えられる場合. struct dynamic_modint{ //mod変更が可能 最初にsetmod必須 idxで複数個所持が可能. private: static int mod; public: long long v = 0; static constexpr long long getmod(){return mod;} static void setmod(int m){ assert(m > 0); mod = m; } dynamic_modint(){v = 0;} dynamic_modint(int a){v = a<0?a+mod:a;} dynamic_modint(long long a){v = a<0?a+mod:a;} dynamic_modint(unsigned int a){v = a;} dynamic_modint(unsigned long long a){v = a;} long long val()const{return v;} void modu(){v = (v%mod+mod)%mod;} dynamic_modint &operator=(const dynamic_modint &b) = default; dynamic_modint operator+()const{return (*this);} dynamic_modint operator-()const{return dynamic_modint(0)-(*this);} dynamic_modint operator+(const dynamic_modint b)const{return dynamic_modint(v)+=b;} dynamic_modint operator-(const dynamic_modint b)const{return dynamic_modint(v)-=b;} dynamic_modint operator*(const dynamic_modint b)const{return dynamic_modint(v)*=b;} dynamic_modint operator/(const dynamic_modint b)const{return dynamic_modint(v)/=b;} dynamic_modint operator+=(const dynamic_modint b){ v += b.v; if(v >= mod) v -= mod; return *this; } dynamic_modint operator-=(const dynamic_modint b){ v -= b.v; if(v < 0) v += mod; return *this; } dynamic_modint operator*=(const dynamic_modint b){v = v*b.v%mod; return *this;} dynamic_modint operator/=(dynamic_modint b){ //b!=0 mod素数が必須. if(b == 0) assert(false); int left = mod-2; while(left){if(left&1) *this *= b; b *= b; left >>= 1;} return *this; } dynamic_modint operator++(){*this += 1; return *this;} dynamic_modint operator--(){*this -= 1; return *this;} dynamic_modint operator++(int){*this += 1; return *this;} dynamic_modint operator--(int){*this -= 1; return *this;} bool operator==(const dynamic_modint b)const{return v == b.v;} bool operator!=(const dynamic_modint b)const{return v != b.v;} bool operator>(const dynamic_modint b)const{return v > b.v;} bool operator>=(const dynamic_modint b)const{return v >= b.v;} bool operator<(const dynamic_modint b)const{return v < b.v;} bool operator<=(const dynamic_modint b)const{return v <= b.v;} dynamic_modint pow(long long n)const{ dynamic_modint ret = 1,p = v; if(n < 0) p = p.inv(),n = -n; while(n){ if(n&1) ret *= p; p *= p; n >>= 1; } return ret; } dynamic_modint inv()const{return dynamic_modint(1)/v;} //素数mod必須. }; template<int idx> int dynamic_modint<idx>::mod=998244353; using mint = dynamic_modint<0>; template<typename T> vector<vector<T>> multima(vector<vector<T>> &A,vector<vector<T>> &B){ assert(A.at(0).size() == B.size() && B.size()); int H = A.size(),W = B.at(0).size(); vector<vector<T>> ret(H,vector<T>(W)); for(int i=0; i<H; i++) for(int k=0; k<W; k++){ for(int l=0; l<A.at(i).size(); l++){ ret.at(i).at(k) += A.at(i).at(l)*B.at(l).at(k); } } return ret; //計算できる行列のみ. } template<typename T> vector<vector<T>> Powmat(vector<vector<T>> A,vector<vector<T>> B,long long N){ //return A^N*B ABは行列; //n*n行列A n*1行列Bと想定 O(n^3*logN). assert(A.size() && A.size() == A.at(0).size() && N >= 0); while(N){ if(N&1) B = multima(A,B); A = multima(A,A); N >>= 1; } return B; } using SS = tuple<mint,mint,mint,mint>; class SegmentTree{ public: int siz = -1,n = -1; vector<SS> dat; SS op(SS a, SS b){ auto [a0,a1,a2,a3] = a; auto [b0,b1,b2,b3] = b; return {a0*b0+a1*b2,a0*b1+a1*b3,a2*b0+a3*b2,a2*b1+a3*b3}; } SS e(){return {1,0,0,1};} void renew (SS &a,SS x){ a = op(a,x); //a = x; //set(pos,x)で可能. //その他. } SegmentTree(int N){init(N);} SegmentTree(const vector<SS> &A){//長さ配列サイズに合わせる. siz = 1; n = A.size(); while(siz < n) siz *= 2; dat.resize(siz*2,e()); for(int i=0; i<n; i++) dat.at(i+siz) = A.at(i); for(int i=siz-1; i>0; i--) dat.at(i) = op(dat.at(i*2),dat.at(i*2+1)); } void init(int N){ //全要素単位元に初期化. siz = 1; n = N; while(siz < n) siz *= 2; dat.assign(siz*2,e()); } void init(const vector<SS> &A){//長さ配列サイズに合わせる. siz = 1; n = A.size(); while(siz < n) siz *= 2; dat.resize(siz*2,e()); for(int i=0; i<n; i++) dat.at(i+siz) = A.at(i); for(int i=siz-1; i>0; i--) dat.at(i) = op(dat.at(i*2),dat.at(i*2+1)); } void set(int pos,SS x){ pos = pos+siz; dat.at(pos) = x; while(pos != 1){ pos = pos/2; dat.at(pos) = op(dat.at(pos*2),dat.at(pos*2+1)); } } void update(int pos,SS x){ pos = pos+siz; renew(dat.at(pos),x); while(pos != 1){ pos = pos/2; dat.at(pos) = op(dat.at(pos*2),dat.at(pos*2+1)); } } SS findans(int l, int r){ SS retl = e(),retr = e(); l += siz,r += siz; while(l < r){ if(l&1) retl = op(retl,dat.at(l++)); if(r&1) retr = op(dat.at(--r),retr); l >>= 1; r >>= 1; } return op(retl,retr); } SS get(int pos){return dat.at(pos+siz);} SS rangeans(int l, int r){return findans(l,r);} SS allrange(){return dat.at(1);} //rightは) leftは[で 渡す&返す. int maxright(const function<bool(SS)> f,int l = 0){ //fを満たさない最小の箇所を返す なければn. l += siz; int r = n+siz; vector<int> ls,rs; while(l < r){ if(l&1) ls.push_back(l++); if(r&1) rs.push_back(--r); l >>= 1; r >>= 1; } SS okl = e(); for(int i=0; i<ls.size(); i++){ l = ls.at(i); SS now = op(okl,dat.at(l)); if(!f(now)){ while(l < siz){ l <<= 1; now = op(okl,dat.at(l)); if(f(now)){okl = now; l++;} } return l-siz; } okl = now; } for(int i=rs.size()-1; i>=0; i--){ l = rs.at(i); SS now = op(okl,dat.at(l)); if(!f(now)){ while(l < siz){ l <<= 1; now = op(okl,dat.at(l)); if(f(now)){okl = now; l++;} } return l-siz; } okl = now; } return n; } int minleft(const function<bool(SS)> f,int r = -1){ //fを満たす最小の箇所を返す なければ0. if(r == -1) r = n; int l = siz; r += siz; vector<int> ls,rs; while(l < r){ if(l&1) ls.push_back(l++); if(r&1) rs.push_back(--r); l >>= 1; r >>= 1; } SS okr = e(); for(int i=0; i<rs.size(); i++){ r = rs.at(i); SS now = op(dat.at(r),okr); if(!f(now)){ while(r < siz){ r <<= 1; r++; now = op(dat.at(r),okr); if(f(now)){okr = now; r--;} } return r+1-siz; } okr = now; } for(int i=ls.size()-1; i>=0; i--){ r = ls.at(i); SS now = op(dat.at(r),okr); if(!f(now)){ while(r < siz){ r <<= 1; r++; now = op(dat.at(r),okr); if(f(now)){okr = now; r--;} } return r+1-siz; } okr = now; } return 0; } }; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int K,N; cin >> K >> N; mint::setmod(K); vector<SS> give(N); for(auto &[a,b,c,d] : give){ cin >> a.v >> b.v >> c.v >> d.v; a.modu(),b.modu(),c.modu(),d.modu(); } SegmentTree Z(give); int Q; cin >> Q; while(Q--){ int pos,l,r; cin >> pos >> l >> r; pos--,l--; mint a,b,c,d; cin >> a.v >> b.v >> c.v >> d.v; a.modu(),b.modu(),c.modu(),d.modu(); Z.set(pos,{a,b,c,d}); tie(a,b,c,d) = Z.rangeans(l,r); cout << a.v << " " << b.v << "\n" << c.v << " " << d.v << "\n"; } }