結果

問題 No.1783 Remix Sum
ユーザー PCTprobabilityPCTprobability
提出日時 2021-10-24 22:40:07
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 11,066 bytes
コンパイル時間 5,664 ms
コンパイル使用メモリ 293,700 KB
実行使用メモリ 41,128 KB
最終ジャッジ日時 2024-07-19 00:50:13
合計ジャッジ時間 245,932 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
11,272 KB
testcase_01 AC 33 ms
11,264 KB
testcase_02 AC 33 ms
11,228 KB
testcase_03 AC 35 ms
11,376 KB
testcase_04 AC 191 ms
12,672 KB
testcase_05 AC 189 ms
12,800 KB
testcase_06 AC 1,716 ms
12,744 KB
testcase_07 AC 5,907 ms
15,712 KB
testcase_08 AC 2,327 ms
12,672 KB
testcase_09 AC 2,330 ms
12,780 KB
testcase_10 AC 189 ms
12,892 KB
testcase_11 AC 184 ms
12,776 KB
testcase_12 AC 5,962 ms
15,712 KB
testcase_13 AC 5,929 ms
15,712 KB
testcase_14 AC 2,328 ms
12,768 KB
testcase_15 AC 6,159 ms
41,004 KB
testcase_16 AC 5,910 ms
15,716 KB
testcase_17 AC 5,913 ms
15,760 KB
testcase_18 AC 185 ms
12,740 KB
testcase_19 AC 2,332 ms
12,672 KB
testcase_20 AC 2,701 ms
12,800 KB
testcase_21 AC 2,182 ms
12,672 KB
testcase_22 AC 2,190 ms
12,800 KB
testcase_23 AC 1,865 ms
12,928 KB
testcase_24 AC 2,482 ms
12,928 KB
testcase_25 AC 1,706 ms
12,848 KB
testcase_26 AC 5,900 ms
15,720 KB
testcase_27 AC 1,676 ms
12,800 KB
testcase_28 AC 1,713 ms
12,652 KB
testcase_29 AC 2,684 ms
12,800 KB
testcase_30 AC 2,701 ms
12,800 KB
testcase_31 AC 2,328 ms
12,800 KB
testcase_32 AC 6,200 ms
41,128 KB
testcase_33 AC 2,701 ms
12,928 KB
testcase_34 AC 2,707 ms
12,900 KB
testcase_35 AC 5,915 ms
15,592 KB
testcase_36 AC 6,169 ms
41,008 KB
testcase_37 AC 6,178 ms
41,012 KB
testcase_38 AC 5,943 ms
15,848 KB
testcase_39 AC 2,707 ms
12,928 KB
testcase_40 AC 1,719 ms
12,672 KB
testcase_41 AC 2,707 ms
12,916 KB
testcase_42 AC 2,709 ms
12,928 KB
testcase_43 AC 5,943 ms
15,720 KB
testcase_44 AC 489 ms
12,800 KB
testcase_45 AC 1,728 ms
12,772 KB
testcase_46 AC 2,343 ms
12,800 KB
testcase_47 AC 2,718 ms
13,056 KB
testcase_48 AC 5,970 ms
15,716 KB
testcase_49 AC 6,193 ms
41,004 KB
testcase_50 AC 490 ms
12,912 KB
testcase_51 AC 1,735 ms
12,852 KB
testcase_52 AC 2,341 ms
12,880 KB
testcase_53 AC 2,711 ms
12,980 KB
testcase_54 AC 5,951 ms
15,716 KB
testcase_55 AC 6,199 ms
41,004 KB
testcase_56 AC 610 ms
12,600 KB
testcase_57 AC 1,734 ms
12,928 KB
testcase_58 AC 2,341 ms
12,800 KB
testcase_59 AC 2,714 ms
12,988 KB
testcase_60 WA -
testcase_61 AC 6,214 ms
41,008 KB
testcase_62 AC 491 ms
12,752 KB
testcase_63 AC 1,727 ms
12,800 KB
testcase_64 AC 2,338 ms
12,860 KB
testcase_65 AC 2,716 ms
12,904 KB
testcase_66 AC 5,960 ms
15,720 KB
testcase_67 WA -
testcase_68 AC 219 ms
12,784 KB
testcase_69 AC 1,724 ms
12,780 KB
testcase_70 WA -
testcase_71 AC 2,713 ms
12,908 KB
testcase_72 AC 5,967 ms
15,720 KB
testcase_73 WA -
testcase_74 AC 216 ms
12,672 KB
testcase_75 AC 1,730 ms
12,844 KB
testcase_76 AC 2,343 ms
12,660 KB
testcase_77 AC 2,723 ms
12,920 KB
testcase_78 AC 5,967 ms
15,720 KB
testcase_79 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#include "atcoder/convolution.hpp"
#include "atcoder/modint.hpp"
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 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 mod = 120586241;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
//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>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 = atcoder::static_modint<120586241>;
mint x;
ll Sum[1000000];
ll sum2(ll x,vector<ll> base={-1}){
  if(base.size()>0&&base[0]==-1){
    ll res=0;
    while(x){
      res+=x/10;
      x/=10;
    }
    return res;
  }
  else{
    ll res=0;
    ll now=1;
    for(int i=0;i<base.size()-1;i++){
      now*=base[i];
      res+=x/now;
    }
    return res%int(base.size());
  }
}
void Su(){
  for(int i=0;i<1000000;i++){
    Sum[i]=sum2(i);
  }
}
ll sum(ll x,vector<ll> base={-1}){
  return Sum[x];
  if(base.size()>0&&base[0]==-1){
    ll res=0;
    while(x){
      res+=x/10;
      x/=10;
    }
    return res;
  }
  else{
    ll res=0;
    ll now=1;
    for(int i=0;i<base.size()-1;i++){
      now*=base[i];
      res+=x/now;
    }
    return res%int(base.size());
  }
}
void _ntt(vector<mint> &a,ll sign){
  if(sign==1){
    atcoder::internal::butterfly(a);
  }else {
    atcoder::internal::butterfly_inv(a);
    //mint invn = mint{1} / a.size();
    //for(auto&x:a)x*=invn;
  }
}
vector<vector<mint>> _twofft(vector<vector<mint>> a,vector<vector<mint>> b){
  int n=a.size();
  int m=a[0].size();
  int p=1;
  while(p<m*2) p*=2;
  m=p;
  for(int i=0;i<n;i++){
    while(int(a[i].size())!=m){
      a[i].pb(0);
      b[i].pb(0);
    }
    _ntt(a[i],1);
    _ntt(b[i],1);
  }
  vector<vector<mint>> c(n,vector<mint>(m));
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      for(int k=0;k<m;k++){
        c[(i+j)%n][k]+=a[i][k]*b[j][k];
      }
    }
  }
  for(int i=0;i<n;i++){
    _ntt(c[i],-1);
    for(int j=0;j<m;j++) c[i][j]/=p;
  }
  return c;
}
vector<mint> twofft(vector<mint> a,vector<mint> b,vector<ll> base={-1},ll X=-1){
  ll n=a.size();
  if(X!=-1) n=X;
  ll k=base.size();
  if(base[0]==-1){
    k=-1;
    ll x=n;
    while(x){
      k++;
      x/=10;
    }
  }
  vector<vector<mint>> c(k,vector<mint>(n));
  vector<vector<mint>> d(k,vector<mint>(n));
  for(int i=0;i<n;i++){
    c[sum(i,base)%(k)][i]+=a[i];
    d[sum(i,base)%(k)][i]+=b[i];
  }
  c=_twofft(c,d);
  vector<mint> res(n);
  for(int i=0;i<n;i++){
    ll p=sum(i,base)%(k);
    while(p<int(c.size())){
      res[i]+=c[p][i];
      p+=k;
    }
  }
  return res;
}
vector<mint> multiinv(vector<mint> f,vector<ll> base={-1},ll X=-1){
  ll n=f.size();
  ll k=base.size();
  if(X==-1){
    X=1000000;
  }
  if(int(base.size())>=1&&base[0]==-1){
    k=-1;
    base={};
    ll x=n;
    while(x){
      k++;
      x/=10;
    }
    for(int i=0;i<k;i++) base.pb(10);
  }
  vector<mint> g={mint(1)/mint(f[0])};
  vector<mint> f2,g2;
  for(int d=1;d<min(n,X);d*=2){
    f2.resize(2*d);
    g2.resize(2*d);
    for(int i=0;i<d;i++){
      g2[i]=-g[i];
    }
    for(int i=0;i<min(int(f.size()),2*d);i++){
      f2[i]=f[i];
    }
    f2=twofft(f2,g2,base,2*d);
    f2[0]+=2;
    f2=twofft(f2,g2,base,2*d);
    for(int i=0;i<2*d;i++) f2[i]*=-1;
    g=f2;
  }
  g.resize(min(n,X));
  return g;
}
vector<vector<mint>> station(vector<mint> f,vector<ll> base={-1}){
  ll n=f.size();
  ll k=base.size();
  if(base[0]==-1){
    base={};
    k=-1;
    ll x=n;
    while(x){
      x/=10;
      k++;
    }
    for(int i=0;i<k;i++) base.pb(10);
  }
  vector<vector<mint>> f2(k,vector<mint>(n));
  for(int i=0;i<n;i++) f2[sum(i,base)%k][i]+=f[i];
  return f2;
}
vector<mint> diff(vector<mint> f){
  for(int i=0;i<int(f.size());i++) f[i]*=i;
  return f;
}
vector<mint> integ(vector<mint> f){
  for(int i=0;i<int(f.size());i++){
    mint x=0;
    if(i) x=mint(1)/mint(i);
    f[i]*=x;
  }
  return f;
}
vector<mint> multilog(vector<mint> f,vector<ll> base={-1},ll X=-1){
  ll n=f.size();
  ll k=base.size();
  if(base[0]==-1){
    base={};
    k=-1;
    ll x=n;
    while(x){
      k++;
      x/=10;
    }
    for(int i=0;i<k;i++) base.pb(10);
  }
  auto g=f;
  f=diff(f);
  if(X==-1){
    g=multiinv(g,base);
  }
  else{
    g=multiinv(g,base,X);
  }
  if(X==-1){
    vector<mint> res=twofft(f,g,base);
    res=integ(res);
    return res;
  }
  else{
    vector<mint> res=twofft(f,g,base,X);
    res=integ(res);
    return res;
  }
}
vector<mint> multiexp(vector<mint> f,vector<ll> base){
  ll n=f.size();
  ll k=base.size();
  if(base.size()>=1&&base[0]==-1){
    base={};
    k=-1;
    ll x=n;
    while(x){
      k++;
      x/=10;
    }
    for(int i=0;i<k;i++) base.pb(10);
  }
  if(base.size()==0){
    return {mint(1)};
  }
  else{
    vector<mint> g={mint(1)};
    for(int d=1;d<n;d*=2){
      vector<mint> f2(2*d);
      vector<mint> g2(2*d);
      for(int i=0;i<min(int(f.size()),2*d);i++) f2[i]=f[i];
      f2[0]++;
      for(int i=0;i<d;i++) g2[i]=g[i];
      g2=multilog(g2,base,2*d);
      for(int i=0;i<2*d;i++) f2[i]-=g2[i];
      vector<mint> g3(2*d);
      for(int i=0;i<d;i++) g3[i]=g[i];
      f2=twofft(f2,g3,base,2*d);
      g=f2;
    }
    g.resize(n);
    return g;
  }
}
vector<mint> multipow(vector<mint> f,vector<ll> base,ll p){
  if(f[0].val()!=0){
    mint x=f[0];
    for(int i=0;i<f.size();i++) f[i]/=x;
    f=multilog(f,base);
    for(int i=0;i<f.size();i++) f[i]*=p;
    f=multiexp(f,base);
    x=mint(x).pow(p);
    for(int i=0;i<f.size();i++) f[i]*=x;
    return f;
  }
  else{
    ll k=min(p,11ll);
    ll n=f.size();
    vector<mint> now(n);
    now[0]=1;
    while(k){
      if(k%2){
        now=twofft(now,f,base);
      }
      f=twofft(f,f,base);
      k/=2;
    }
    return now;
  }
}
vector<mint> solve(ll n,ll m,ll p,vector<mint> f){
  if(n==m){
    vector<ll> base;
    for(int i=0;i<n;i++) base.pb(10);
    f=multipow(f,base,p);
    return f;
  }
  else{
    if(n==1){
      vector<mint> res(10);
      res[0]=1;
      while(p){
        if(p%2){
          vector<mint> res2(10);
          for(int i=0;i<10;i++){
            for(int j=0;j<10;j++){
              res2[(i+j)%10]+=res[i]*f[j];
            }
          }
          res=res2;
        }
        vector<mint> g(10);
        for(int i=0;i<10;i++){
          for(int j=0;j<10;j++){
            g[(i+j)%10]+=f[i]*f[j];
          }
        }
        f=g;
        p/=2;
      }
      return res;
    }
    else{
      ll u=f.size();
      vector<mint> xp(100);
      xp[0]=1;
      for(int i=1;i<100;i++) xp[i]=xp[i-1]*x;
      vector<vector<mint>> f2(10,vector<mint>(u/10));
      for(int i=0;i<10;i++){
        for(int j=0;j<u;j++){
          f2[i][j%(u/10)]+=f[j]*xp[(j/(u/10))*i];
        }
      }
      for(int i=0;i<10;i++){
        f2[i]=solve(n-1,m,p,f2[i]);
      }
      vector<mint> f3(u);
      for(int i=0;i<10;i++){
        for(int j=0;j<10;j++){
          for(int k=0;k<u/10;k++){
            f3[(u/10)*i+k]+=f2[j][k]*xp[(j*(10-i))];
          }
        }
      }
      for(int i=0;i<u;i++) f3[i]/=10;
      return f3;
    }
  }
}
int main() {
  cincout();
  Su();
  x=9142366;
  ll n,k,m,t;
  cin>>n>>k>>m>>t;
  ll a=1;
  for(int i=0;i<k;i++) a*=10;
  vector<mint> f(a);
  for(int i=0;i<n;i++){
    ll p;
    cin>>p;
    f[p]++;
  }
  vector<mint> ans=solve(k,t,m,f);
  for(int i=0;i<ans.size();i++) cout<<ans[i].val()<<endl;
}
0