結果
問題 | No.2164 Equal Balls |
ユーザー | akua |
提出日時 | 2022-12-28 21:56:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,046 ms / 5,000 ms |
コード長 | 4,654 bytes |
コンパイル時間 | 5,303 ms |
コンパイル使用メモリ | 236,620 KB |
実行使用メモリ | 36,076 KB |
最終ジャッジ日時 | 2024-05-03 03:30:06 |
合計ジャッジ時間 | 47,545 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
18,764 KB |
testcase_01 | AC | 47 ms
18,308 KB |
testcase_02 | AC | 45 ms
18,756 KB |
testcase_03 | AC | 46 ms
18,652 KB |
testcase_04 | AC | 46 ms
18,532 KB |
testcase_05 | AC | 48 ms
18,388 KB |
testcase_06 | AC | 46 ms
18,544 KB |
testcase_07 | AC | 44 ms
18,400 KB |
testcase_08 | AC | 87 ms
23,356 KB |
testcase_09 | AC | 78 ms
22,052 KB |
testcase_10 | AC | 61 ms
20,768 KB |
testcase_11 | AC | 123 ms
28,352 KB |
testcase_12 | AC | 92 ms
23,944 KB |
testcase_13 | AC | 72 ms
21,820 KB |
testcase_14 | AC | 89 ms
22,620 KB |
testcase_15 | AC | 128 ms
27,472 KB |
testcase_16 | AC | 85 ms
23,540 KB |
testcase_17 | AC | 55 ms
19,832 KB |
testcase_18 | AC | 103 ms
25,360 KB |
testcase_19 | AC | 147 ms
29,452 KB |
testcase_20 | AC | 92 ms
24,132 KB |
testcase_21 | AC | 51 ms
19,248 KB |
testcase_22 | AC | 50 ms
19,080 KB |
testcase_23 | AC | 603 ms
22,772 KB |
testcase_24 | AC | 396 ms
31,240 KB |
testcase_25 | AC | 629 ms
20,624 KB |
testcase_26 | AC | 222 ms
31,504 KB |
testcase_27 | AC | 485 ms
33,284 KB |
testcase_28 | AC | 500 ms
32,936 KB |
testcase_29 | AC | 244 ms
22,236 KB |
testcase_30 | AC | 454 ms
29,116 KB |
testcase_31 | AC | 694 ms
22,604 KB |
testcase_32 | AC | 511 ms
31,504 KB |
testcase_33 | AC | 378 ms
20,920 KB |
testcase_34 | AC | 509 ms
23,280 KB |
testcase_35 | AC | 133 ms
18,944 KB |
testcase_36 | AC | 955 ms
33,448 KB |
testcase_37 | AC | 1,114 ms
21,352 KB |
testcase_38 | AC | 1,974 ms
35,552 KB |
testcase_39 | AC | 1,958 ms
36,076 KB |
testcase_40 | AC | 1,937 ms
35,608 KB |
testcase_41 | AC | 1,934 ms
35,860 KB |
testcase_42 | AC | 1,974 ms
35,736 KB |
testcase_43 | AC | 1,965 ms
35,740 KB |
testcase_44 | AC | 1,980 ms
35,524 KB |
testcase_45 | AC | 1,954 ms
35,776 KB |
testcase_46 | AC | 1,923 ms
35,740 KB |
testcase_47 | AC | 2,046 ms
35,452 KB |
testcase_48 | AC | 1,970 ms
35,692 KB |
testcase_49 | AC | 1,794 ms
20,564 KB |
testcase_50 | AC | 1,808 ms
20,812 KB |
testcase_51 | AC | 1,808 ms
20,652 KB |
testcase_52 | AC | 1,879 ms
20,720 KB |
testcase_53 | AC | 1,792 ms
20,736 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <atcoder/all> #include <iostream> // cout, endl, cin #include <string> // string, to_string, stoi #include <vector> // vector #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound #include <utility> // pair, make_pair #include <tuple> // tuple, make_tuple #include <cstdint> // int64_t, int*_t #include <cstdio> // printf #include <map> // map #include <queue> // queue, priority_queue #include <set> // set #include <stack> // stack #include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset #include <cctype> // isupper, islower, isdigit, toupper, tolower #include <math.h> #include <iomanip> #include <functional> using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; using graph = vector<vector<int> > ; using P= pair<ll,ll>; using vi=vector<int>; using vvi=vector<vi>; using vll=vector<ll>; using vvll=vector<vll>; using vp=vector<P>; using vpp=vector<vp>; using vd=vector<double>; using vvd =vector<vd>; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++17 -I . //cout <<setprecision(20); //cout << fixed << setprecision(10); //cin.tie(0); ios::sync_with_stdio(false); const double PI = acos(-1); int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1}; void putsYes(bool f){cout << (f?"Yes":"No") << endl;} void putsYES(bool f){cout << (f?"YES":"NO") << endl;} void putsFirst(bool f){cout << (f?"First":"Second") << endl;} void debug(int test){cout << "TEST" << " " << test << endl;} // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division ll mod =998244353; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} // combination mod prime // https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619 struct combination { vector<mint> fact, ifact; combination(int n):fact(n+1),ifact(n+1) { //assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(500000); using vm=vector<mint> ; using vvm=vector<vm> ; //g++ main.cpp -std=c++17 -I . const int M=600; const int N=1000; ll comb[N][N]; void init_comb(int M){ comb[0][0]=1; for(int i=1; i<N; i++){ for(int j=0; j<=i; j++){ if(j==0 || j==i)comb[i][j]=1; else comb[i][j]=(comb[i-1][j]+comb[i-1][j-1])%M; } } } int main(){cin.tie(0);ios::sync_with_stdio(false); init_comb(mod); int n,m; cin >> n >> m; vi a(n),b(n),x(n); rep(i,n)cin >> a[i]; rep(i,n)cin >> b[i]; rep(i,n)x[i]=a[i]+b[i]; vvll dp2(m,vll(M+1)); auto f=[&](int i,int j){ ll res=0; if(j>=0)res=comb[i][j]; return res; }; rep(i,m)rep(j,x[i]+1){ int d=j-a[i]; dp2[i][j]=f(x[i],j); for(int k=i+m; k<n; k+=m){ dp2[i][j]*=f(x[k],a[k]+d); dp2[i][j]%=mod; } } queue<int> q; rep(i,m)q.push(i); while(q.size()>=2){ auto ax=q.front();q.pop(); auto bx=q.front();q.pop(); dp2[ax]=convolution(dp2[ax],dp2[bx]); q.push(ax); } ll tot=0;rep(i,m)tot+=a[i]; ll ans=dp2[q.front()][tot]; cout << ans << endl; }