結果
問題 | No.2164 Equal Balls |
ユーザー | PCTprobability |
提出日時 | 2022-11-22 00:06:09 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 771 ms / 5,000 ms |
コード長 | 5,592 bytes |
コンパイル時間 | 4,834 ms |
コンパイル使用メモリ | 281,040 KB |
実行使用メモリ | 23,560 KB |
最終ジャッジ日時 | 2024-11-08 15:57:46 |
合計ジャッジ時間 | 21,104 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
5,888 KB |
testcase_01 | AC | 5 ms
5,760 KB |
testcase_02 | AC | 5 ms
5,760 KB |
testcase_03 | AC | 5 ms
5,888 KB |
testcase_04 | AC | 5 ms
5,888 KB |
testcase_05 | AC | 6 ms
5,888 KB |
testcase_06 | AC | 6 ms
6,016 KB |
testcase_07 | AC | 6 ms
5,760 KB |
testcase_08 | AC | 59 ms
9,852 KB |
testcase_09 | AC | 37 ms
8,452 KB |
testcase_10 | AC | 22 ms
7,424 KB |
testcase_11 | AC | 88 ms
12,932 KB |
testcase_12 | AC | 51 ms
10,236 KB |
testcase_13 | AC | 33 ms
8,320 KB |
testcase_14 | AC | 42 ms
8,960 KB |
testcase_15 | AC | 84 ms
12,544 KB |
testcase_16 | AC | 47 ms
9,616 KB |
testcase_17 | AC | 14 ms
6,784 KB |
testcase_18 | AC | 63 ms
11,212 KB |
testcase_19 | AC | 105 ms
14,840 KB |
testcase_20 | AC | 55 ms
10,468 KB |
testcase_21 | AC | 11 ms
6,272 KB |
testcase_22 | AC | 11 ms
6,272 KB |
testcase_23 | AC | 260 ms
11,776 KB |
testcase_24 | AC | 223 ms
17,596 KB |
testcase_25 | AC | 229 ms
9,856 KB |
testcase_26 | AC | 149 ms
16,764 KB |
testcase_27 | AC | 268 ms
19,124 KB |
testcase_28 | AC | 271 ms
19,148 KB |
testcase_29 | AC | 103 ms
9,472 KB |
testcase_30 | AC | 234 ms
15,168 KB |
testcase_31 | AC | 314 ms
11,904 KB |
testcase_32 | AC | 285 ms
18,832 KB |
testcase_33 | AC | 168 ms
9,344 KB |
testcase_34 | AC | 226 ms
11,520 KB |
testcase_35 | AC | 47 ms
6,400 KB |
testcase_36 | AC | 469 ms
21,940 KB |
testcase_37 | AC | 367 ms
12,416 KB |
testcase_38 | AC | 751 ms
23,428 KB |
testcase_39 | AC | 744 ms
23,428 KB |
testcase_40 | AC | 747 ms
23,300 KB |
testcase_41 | AC | 746 ms
23,432 KB |
testcase_42 | AC | 747 ms
23,300 KB |
testcase_43 | AC | 744 ms
23,560 KB |
testcase_44 | AC | 740 ms
23,424 KB |
testcase_45 | AC | 747 ms
23,432 KB |
testcase_46 | AC | 742 ms
23,296 KB |
testcase_47 | AC | 740 ms
23,428 KB |
testcase_48 | AC | 771 ms
23,432 KB |
testcase_49 | AC | 39 ms
11,776 KB |
testcase_50 | AC | 38 ms
11,904 KB |
testcase_51 | AC | 617 ms
12,032 KB |
testcase_52 | AC | 623 ms
11,904 KB |
testcase_53 | AC | 615 ms
12,032 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = unsigned long long; #define endl "\n" typedef pair<int, int> Pii; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i)) #define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++) #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(x) begin(x), end(x) #define PB push_back #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #define all(s) (s).begin(),(s).end() #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) #define fi first #define se second #define pb push_back #define P pair<ll,ll> #define PQminll priority_queue<ll, vector<ll>, greater<ll>> #define PQmaxll priority_queue<ll,vector<ll>,less<ll>> #define PQminP priority_queue<P, vector<P>, greater<P>> #define PQmaxP priority_queue<P,vector<P>,less<P>> #define NP next_permutation typedef string::const_iterator State; class ParseError {}; //const ll mod = 1000000009; const ll mod = 998244353; //const ll mod = 1000000007; const ll inf = 4100000000000000000; const ld eps = ld(0.00000000000001); //static const long double pi = 3.141592653589793; template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];} template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];} template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;} template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}} template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;} void yes(bool a){cout<<(a?"yes":"no")<<endl;} void YES(bool a){cout<<(a?"YES":"NO")<<endl;} void Yes(bool a){cout<<(a?"Yes":"No")<<endl;} void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; } void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; } void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; } template<class T>void print(T a){cout<<a<<endl;} template<class T>auto min(const T& a){ return *min_element(all(a)); } template<class T>auto max(const T& a){ return *max_element(all(a)); } template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<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 (b<a) { a=b; return 1; } return 0;} template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;} ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; } ll pop(ll x){return __builtin_popcountll(x);} ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;} P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;} P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});} P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});} P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});} P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});} P Pgyaku(P a){ return hyou({a.se,a.fi});} void cincout(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(15); } using mint = modint998244353; //using mint = modint1000000007; ostream &operator<<(ostream &os,mint m){ os<<m.val(); return os; } istream &operator>>(istream &is,mint m){ ll x; is>>x; m=x; return is; } constexpr ll MAX = 100000; ll fac[MAX],finv[MAX],inv[MAX]; void COMinit(){ fac[0]=fac[1]=1; finv[0]=finv[1]=1; inv[1]=1; for(int i=2;i<MAX;i++){ fac[i]=fac[i-1]*i%mod; inv[i]=mod-inv[mod%i]*(mod/i)%mod; finv[i]=finv[i-1]*inv[i]%mod; } } ll binom(ll n,ll k){ if(n<k) return 0; if(n<0||k<0) return 0; return fac[n]*(finv[k]*finv[n-k]%mod)%mod; } int main() { cincout(); COMinit(); ll n,m; cin>>n>>m; vector<ll> a(n),b(n),p(n),q(n); vcin(a); vcin(b); for(int i=0;i<n;i++) p[i]=a[i]+b[i]; for(int i=0;i<n;i++) q[i]=a[i]; if(m==1){ mint ans=1; for(int i=0;i<n;i++) ans*=binom(p[i],q[i]); cout<<ans<<endl; return 0; } vector<vector<mint>> f(m,vector<mint>(601,1)); for(int i=0;i<n;i++){ ll u=i%m; if(i>=m){ for(int j=0;j<=600;j++) f[u][j]*=binom(p[i],j+q[i]-q[u]); } else{ for(int j=0;j<=600;j++) f[u][j]*=binom(p[i],j); } } queue<ll> que; for(int i=0;i<m;i++) que.push(i); while(que.size()>=2){ ll a=que.front(); que.pop(); ll b=que.front(); que.pop(); f[a]=convolution(f[a],f[b]); que.push(a); } vector<mint> g=f[que.front()]; ll sum=0; for(int i=0;i<m;i++) sum+=q[i]; cout<<g[sum].val()<<endl; }