結果
問題 | No.2164 Equal Balls |
ユーザー | akua |
提出日時 | 2022-12-28 20:20:57 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,976 bytes |
コンパイル時間 | 6,574 ms |
コンパイル使用メモリ | 239,272 KB |
実行使用メモリ | 22,648 KB |
最終ジャッジ日時 | 2024-10-02 20:34:51 |
合計ジャッジ時間 | 106,816 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
11,136 KB |
testcase_01 | AC | 43 ms
11,156 KB |
testcase_02 | AC | 42 ms
11,240 KB |
testcase_03 | AC | 42 ms
11,096 KB |
testcase_04 | AC | 43 ms
11,264 KB |
testcase_05 | AC | 43 ms
11,264 KB |
testcase_06 | AC | 43 ms
11,392 KB |
testcase_07 | AC | 44 ms
11,264 KB |
testcase_08 | AC | 90 ms
14,364 KB |
testcase_09 | AC | 79 ms
13,864 KB |
testcase_10 | AC | 63 ms
12,708 KB |
testcase_11 | AC | 135 ms
17,236 KB |
testcase_12 | AC | 94 ms
14,408 KB |
testcase_13 | AC | 76 ms
13,452 KB |
testcase_14 | AC | 84 ms
14,260 KB |
testcase_15 | AC | 130 ms
17,016 KB |
testcase_16 | AC | 89 ms
14,284 KB |
testcase_17 | AC | 53 ms
11,988 KB |
testcase_18 | AC | 109 ms
15,116 KB |
testcase_19 | AC | 152 ms
17,840 KB |
testcase_20 | AC | 99 ms
14,668 KB |
testcase_21 | AC | 50 ms
11,776 KB |
testcase_22 | AC | 51 ms
11,776 KB |
testcase_23 | AC | 1,218 ms
14,328 KB |
testcase_24 | AC | 715 ms
18,924 KB |
testcase_25 | AC | 1,163 ms
13,148 KB |
testcase_26 | AC | 309 ms
19,304 KB |
testcase_27 | AC | 866 ms
20,132 KB |
testcase_28 | AC | 908 ms
20,372 KB |
testcase_29 | AC | 428 ms
13,608 KB |
testcase_30 | AC | 846 ms
18,076 KB |
testcase_31 | AC | 1,429 ms
14,172 KB |
testcase_32 | AC | 963 ms
19,552 KB |
testcase_33 | AC | 776 ms
12,892 KB |
testcase_34 | AC | 1,029 ms
14,544 KB |
testcase_35 | AC | 232 ms
11,648 KB |
testcase_36 | AC | 1,862 ms
21,160 KB |
testcase_37 | AC | 1,740 ms
14,148 KB |
testcase_38 | TLE | - |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | TLE | - |
testcase_42 | TLE | - |
testcase_43 | TLE | - |
testcase_44 | TLE | - |
testcase_45 | TLE | - |
testcase_46 | TLE | - |
testcase_47 | TLE | - |
testcase_48 | TLE | - |
testcase_49 | AC | 4,672 ms
13,500 KB |
testcase_50 | AC | 4,685 ms
13,568 KB |
testcase_51 | AC | 4,702 ms
13,620 KB |
testcase_52 | AC | 4,707 ms
13,432 KB |
testcase_53 | AC | 4,687 ms
13,404 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;} ll pow_pow(ll x,ll n,ll mod){ if(n==0) return 1; x%=mod; ll res=pow_pow(x*x%mod,n/2,mod); if(n&1)res=res*x%mod; return res; } ll gcd(ll x,ll y){ if(y==0)return x; return gcd(y,x%y); } ll lcm(ll x,ll y){ return ll(x/gcd(x,y))*y; } template<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } // 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> ; ll sqrt_(ll x) { ll l = 0, r = ll(3e9)+1; while (l+1<r) { ll c = (l+r)/2; if (c*c <= x) l = c; else r = c; } return l; } int valid(int x,int y,int h,int w){ if(x>=0 && y>=0 && x<h && y<w)return 1; else return 0; } struct edge{ int to; ll cost; edge(int to,ll cost) : to(to),cost(cost){} }; //snuke template<typename T> struct Matrix { int h, w; vector<vector<T> > d; Matrix() {} Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {} Matrix& unit() { //assert(h == w); rep(i,h) d[i][i] = 1; return *this; } const vector<T>& operator[](int i) const { return d[i];} vector<T>& operator[](int i) { return d[i];} Matrix operator*(const Matrix& a) const { //assert(w == a.h); Matrix r(h, a.w); rep(i,h)rep(k,w)rep(j,a.w) { r[i][j] += d[i][k]*a[k][j]; } return r; } Matrix pow(ll t) const { // assert(h == w); if (!t) return Matrix(h,h).unit(); if (t == 1) return *this; Matrix r = pow(t>>1); r = r*r; if (t&1) r = r*(*this); return r; } }; using ve=vector<edge>; using vve=vector<ve>; //g++ main.cpp -std=c++17 -I . const int M=600; int main(){cin.tie(0);ios::sync_with_stdio(false); 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]; vvm dp(m,vm(M+1)); rep(i,m)rep(j,x[i]+1){ int d=j-a[i]; dp[i][j]=c(x[i],j); for(int k=i+m; k<n; k+=m){ dp[i][j]*=c(x[k],a[k]+d); } } vvll dp2(m,vll(M+1)); rep(i,m)rep(j,M+1)dp2[i][j]=dp[i][j].x; queue<vll> q; rep(i,m)q.push(dp2[i]); while(q.size()>=2){ auto ax=q.front();q.pop(); auto bx=q.front();q.pop(); ax=convolution(ax,bx); q.push(ax); } ll tot=0;rep(i,m)tot+=a[i]; ll ans=q.front()[tot]; cout << ans << endl; }