結果
| 問題 | No.619 CardShuffle |
| ユーザー |
 beet
|
| 提出日時 | 2018-12-07 16:50:11 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 83 ms / 3,000 ms |
| コード長 | 6,445 bytes |
| コンパイル時間 | 1,987 ms |
| コンパイル使用メモリ | 205,532 KB |
| 最終ジャッジ日時 | 2025-01-06 18:40:09 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 35 |
ソースコード
#include<bits/stdc++.h>using namespace std;using Int = long long;template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}template <typename T,typename E>struct SegmentTree{using F = function<T(T,T)>;using G = function<T(T,E)>;int n;F f;G g;T ti;vector<T> dat;SegmentTree(){};SegmentTree(F f,G g,T ti):f(f),g(g),ti(ti){}void init(int n_){n=1;while(n<n_) n<<=1;dat.assign(n<<1,ti);}void build(const vector<T> &v){int n_=v.size();init(n_);for(int i=0;i<n_;i++) dat[n+i]=v[i];for(int i=n-1;i;i--)dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);}void update(int k,E a){k+=n;dat[k]=g(dat[k],a);while(k>>=1)dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);}void set_val(int k,T x){dat[k+=n]=x;while(k>>=1)dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);}T query(int a,int b){T vl=ti,vr=ti;for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {if(l&1) vl=f(vl,dat[l++]);if(r&1) vr=f(dat[--r],vr);}return f(vl,vr);}};struct FastIO{FastIO(){cin.tie(0);ios::sync_with_stdio(0);}}fastio_beet;template<typename T,T MOD = 1000000007>struct Mint{T v;Mint():v(0){}Mint(signed v):v(v){}Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}Mint pow(long long k){Mint res(1),tmp(v);while(k){if(k&1) res*=tmp;tmp*=tmp;k>>=1;}return res;}Mint inv(){return pow(MOD-2);}Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}Mint& operator/=(Mint a){return (*this)*=a.inv();}Mint operator+(Mint a) const{return Mint(v)+=a;};Mint operator-(Mint a) const{return Mint(v)-=a;};Mint operator*(Mint a) const{return Mint(v)*=a;};Mint operator/(Mint a) const{return Mint(v)/=a;};Mint operator-(){return v?MOD-v:v;}bool operator==(const Mint a)const{return v==a.v;}bool operator!=(const Mint a)const{return v!=a.v;}bool operator <(const Mint a)const{return v <a.v;}// find x s.t. a^x = bstatic T log(Mint a,Mint b){const T sq=40000;unordered_map<T, T> dp;dp.reserve(sq);Mint res(1);for(int r=0;r<sq;r++){if(!dp.count(res)) dp[res]=r;res*=a;}Mint p=pow(a.inv(),sq);res=b;for(int q=0;q<=MOD/sq+1;q++){if(dp.count(res)){T idx=q*sq+dp[res];if(idx>0) return idx;}res*=p;}return T(-1);}static vector<Mint> fact,finv,invs;static void init(int n){if(n+1<=(signed)fact.size()) return;fact.assign(n+1,1);finv.assign(n+1,1);invs.assign(n+1,1);for(int i=1;i<=n;i++) fact[i]=fact[i-1]*Mint(i);finv[n]=Mint(1)/fact[n];for(int i=n;i>=1;i--) finv[i-1]=finv[i]*Mint(i);for(int i=1;i<=n;i++) invs[i]=finv[i]*fact[i-1];}static Mint comb(long long n,int k){Mint res(1);for(int i=0;i<k;i++){res*=Mint(n-i);res/=Mint(i+1);}return res;}static Mint C(int n,int k){if(n<k||k<0) return Mint(0);init(n);return fact[n]*finv[n-k]*finv[k];}static Mint P(int n,int k){if(n<k||k<0) return Mint(0);init(n);return fact[n]*finv[n-k];}static Mint H(int n,int k){if(n<0||k<0) return Mint(0);if(!n&&!k) return Mint(1);init(n+k-1);return C(n+k-1,k);}static Mint S(int n,int k){Mint res;init(k);for(int i=1;i<=k;i++){Mint tmp=C(k,i)*Mint(i).pow(n);if((k-i)&1) res-=tmp;else res+=tmp;}return res*=finv[k];}static vector<vector<Mint> > D(int n,int m){vector<vector<Mint> > dp(n+1,vector<Mint>(m+1,0));dp[0][0]=Mint(1);for(int i=0;i<=n;i++){for(int j=1;j<=m;j++){if(i-j>=0) dp[i][j]=dp[i][j-1]+dp[i-j][j];else dp[i][j]=dp[i][j-1];}}return dp;}static Mint B(int n,int k){Mint res;for(int j=1;j<=k;j++) res+=S(n,j);return res;}static Mint montmort(int n){Mint res;init(n);for(int k=2;k<=n;k++){if(k&1) res-=finv[k];else res+=finv[k];}return res*=fact[n];}static Mint LagrangePolynomial(vector<Mint> &y,Mint t){int n=y.size()-1;if(t.v<=n) return y[t.v];init(n+1);Mint num(1);for(int i=0;i<=n;i++) num*=t-Mint(i);Mint res;for(int i=0;i<=n;i++){Mint tmp=y[i]*num/(t-Mint(i))*finv[i]*finv[n-i];if((n-i)&1) res-=tmp;else res+=tmp;}return res;}};template<typename T,T MOD>vector<Mint<T, MOD> > Mint<T, MOD>::fact = vector<Mint<T, MOD> >();template<typename T,T MOD>vector<Mint<T, MOD> > Mint<T, MOD>::finv = vector<Mint<T, MOD> >();template<typename T,T MOD>vector<Mint<T, MOD> > Mint<T, MOD>::invs = vector<Mint<T, MOD> >();//INSERT ABOVE HEREsigned main(){int n;cin>>n;n=(n+1)/2;vector<int> v(n);vector<char> c(n);c[0]='+';for(int i=0;i<n;i++){if(i) cin>>c[i];cin>>v[i];}using M = Mint<int>;struct T{int t;M a,b,c;T(){}T(int t,M a,M b,M c):t(t),a(a),b(b),c(c){}bool operator==(const T &o)const{return t==o.t&&a==o.a&&b==o.b&&c==o.c;}};T ti(-1,0,0,0);auto f=[&](T a,T b){if(a==ti) return b;if(ti==b) return a;if(a.t==0) return T(b.t,a.a*b.a,b.b,b.c);if(b.t==0) return T(a.t,a.a,a.b,a.c*b.a);return T(a.t,a.a,a.b+a.c*b.a+b.b,b.c);};auto g=[&](T a,T b){a.t++;return b;};SegmentTree<T, T> seg(f,g,ti);vector<T> vt(n);for(int i=0;i<n;i++){if(c[i]=='*') vt[i]=T(0,v[i],0,0);if(c[i]=='+') vt[i]=T(1,1,0,v[i]);}seg.build(vt);int q;cin>>q;for(int i=0;i<q;i++){char t;int x,y;cin>>t>>x>>y;if(t=='!'){int k=x&1;x>>=1;y>>=1;if(k) swap(v[x],v[y]);else swap(c[x],c[y]);for(int i:{x,y}){if(c[i]=='*') vt[i]=T(0,v[i],0,0);if(c[i]=='+') vt[i]=T(1,1,0,v[i]);seg.update(i,vt[i]);}}if(t=='?'){x>>=1;y>>=1;auto z=seg.query(x,y+1);if(c[x]=='*') cout<<(z.a+z.b+z.c).v<<"\n";if(c[x]=='+') cout<<(z.b+z.c).v<<"\n";}}cout<<flush;return 0;}