結果
| 問題 | No.1547 [Cherry 2nd Tune *] 偶然の勝利の確率 |
| ユーザー |
 kiyoshi0205
|
| 提出日時 | 2021-06-12 00:39:01 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,478 bytes |
| コンパイル時間 | 2,172 ms |
| コンパイル使用メモリ | 180,992 KB |
| 最終ジャッジ日時 | 2025-01-27 03:13:16 |
| 合計ジャッジ時間 | 2,644 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /usr/include/c++/13/string:43,
from /usr/include/c++/13/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
from main.cpp:4:
/usr/include/c++/13/bits/allocator.h: In destructor ‘std::_Vector_base<std::vector<long long int>, std::allocator<std::vector<long long int> > >::_Vector_impl::~_Vector_impl()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = std::vector<long long int>]’: target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /usr/include/c++/13/vector:66,
from /usr/include/c++/13/queue:63,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:157:
/usr/include/c++/13/bits/stl_vector.h:133:14: note: called from here
133 | struct _Vector_impl
| ^~~~~~~~~~~~
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>using namespace std;using ll=long long;using datas=pair<ll,ll>;using ddatas=pair<long double,long double>;using tdata=pair<ll,datas>;using vec=vector<ll>;using mat=vector<vec>;using pvec=vector<datas>;using pmat=vector<pvec>;#define For(i,a,b) for(i=a;i<(ll)b;++i)#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)#define rep(i,N) For(i,0,N)#define rep1(i,N) For(i,1,N)#define brep(i,N) bFor(i,N,0)#define brep1(i,N) bFor(i,N,1)#define all(v) (v).begin(),(v).end()#define allr(v) (v).rbegin(),(v).rend()#define vsort(v) sort(all(v))#define vrsort(v) sort(allr(v))#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())#define endl "\n"#define popcount __builtin_popcountll#define eb emplace_back#define print(x) cout<<x<<endl#define printyes print("Yes")#define printno print("No")#define printYES print("YES")#define printNO print("NO")#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)// constexpr ll mod=1000000007;constexpr ll mod=998244353;constexpr ll inf=1LL<<60;constexpr long double eps=1e-9;const long double PI=acosl(-1);template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}template<class T> ostream& operator<<(ostream& os,const vector<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const set<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}#ifdef DEBUGvoid debugg(){cout<<endl;}template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)#else#define debug(...) (void(0))#endifinline void startupcpp(void) noexcept{cin.tie(0);ios::sync_with_stdio(false);}ll modinv(ll a,const ll m=mod) noexcept{ll b=m,u=1,v=0,t;while(b){t=a/b;a-=t*b; swap(a,b);u-=t*v; swap(u,v);}return (u+m)%m;}class modmatrix{mat a;ll H,W;public:modmatrix(mat& g):a(g){H=g.size();W=g[0].size();}modmatrix(ll i,ll j):a(i,vec(j,0)){H=i;W=j;}modmatrix(ll n):a(n,vec(n,0)){H=W=n;}inline vec& operator [](int k){return a[k];}auto begin(){return a.begin();}auto end(){return a.end();}modmatrix operator +=(modmatrix b){ll i,j;rep(i,this->H)rep(j,this->W){(*this)[i][j]+=b[i][j];if((*this)[i][j]>=mod)(*this)[i][j]-=mod;}return (*this);}modmatrix operator -=(modmatrix b){ll i,j;rep(i,this->H)rep(j,this->W){(*this)[i][j]-=b[i][j];if((*this)[i][j]<0)(*this)[i][j]+=mod;}return (*this);}modmatrix operator *=(modmatrix b){ll i,j,k;assert(this->W==b.H);modmatrix c(this->H,b.W);rep(i,this->H){rep(k,this->W)rep(j,b.W){c[i][j]+=(*this)[i][k]*b[k][j]%mod;}rep(j,b.W)c[i][j]%=mod;}(*this)=c;return (*this);}modmatrix operator ^=(ll K){assert(this->H==this->W);modmatrix c(this->H);ll i;rep(i,this->H)c[i][i]=1;if(K&1)c*=(*this);while(K){K>>=1;(*this)*=(*this);if(K&1)c*=(*this);}this->a.swap(c.a);return (*this);}modmatrix operator +(modmatrix c){return modmatrix(*this)+=c;}modmatrix operator -(modmatrix c){return modmatrix(*this)-=c;}modmatrix operator *(modmatrix c){return modmatrix(*this)*=c;}modmatrix operator ^(ll K){return modmatrix(*this)^=K;}modmatrix del(ll eh,ll ew){ll i,j;mat res;rep(i,H){if(i==eh)continue;res.resize(res.size()+1);rep(j,W){if(j==ew)continue;res.back().eb(a[i][j]);}}return res;}ll determinant(){assert(H==W);ll i,j,k,ans=1;auto b(a);rep(i,H){if(!b[i][i]){For(j,i+1,H)if(b[j][i]){swap(b[i],b[j]);ans*=-1;break;}if(j==H)return 0;}(ans*=b[i][i])%=mod;For(j,i+1,W)(b[i][j]*=modinv(b[i][i]))%=mod;For(j,i+1,H)if(b[j][i]){ll x=mod-b[j][i];b[j][i]=0;For(k,i+1,W){b[j][k]+=x*b[i][k]%mod;if(b[j][k]>=mod)b[j][k]-=mod;}}}if(ans<0)ans+=mod;return ans;}modmatrix inv(){assert(H==W);ll i,j,k;modmatrix b(a),c(H,W);rep(i,H)c[i][i]=1;rep(i,H){if(!b[i][i]){For(j,i+1,H)if(b[j][i]){swap(b[i],b[j]);swap(c[i],c[j]);break;}if(j==H)assert(false);}ll x=modinv(b[i][i]);rep(j,W){(b[i][j]*=x)%=mod;(c[i][j]*=x)%=mod;}rep(j,H){if(i==j)continue;if(b[j][i]){x=mod-b[j][i];rep(k,W){b[j][k]+=x*b[i][k]%mod;if(b[j][k]>=mod)b[j][k]-=mod;c[j][k]+=x*c[i][k]%mod;if(c[j][k]>=mod)c[j][k]-=mod;}}}}return c;}void out(){for(auto x:a)output(x);}};ll p,q;ll S,T,K;int main(){startupcpp();ll i,j;cin>>p>>j>>S;(p*=modinv(j))%=mod;cin>>q>>j>>T>>K;(q*=modinv(j))%=mod;mat A(S+T+1,vec(S+T+1,0));A[0][0]=A[S+T][S+T]=1;mat B=A;rep1(i,S+T){A[i][i]=(mod+1-p)%mod;A[S+T][S+T-i]=A[S+T][S+T+1-i]*p%mod;B[i][i]=(mod+1-q)%mod;B[0][i]=B[0][i-1]*q%mod;}rep1(i,S+T){for(j=i;j<S+T-1;++j)B[i][j+1]=B[i][j]*q%mod;for(j=i;j-1>0;--j)A[i][j-1]=A[i][j]*p%mod;}debug(A);debug(B);modmatrix a(A),b(B),first(S+T+1,1);first[T][0]=1;b*=a;b^=K;b*=first;print(b[S+T][0]);print(b[0][0]);}