結果

問題 No.1307 Rotate and Accumulate
ユーザー saksak
提出日時 2021-01-05 03:28:40
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 875 ms / 5,000 ms
コード長 3,043 bytes
コンパイル時間 2,690 ms
コンパイル使用メモリ 203,000 KB
最終ジャッジ日時 2025-01-17 09:45:10
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = 998244353;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct FastNumberTheoreticTransform {

  ll size = 1, size_x12, root;
  vector<ll> x1, x2, theta;

  void set(vector<ll> &v1, vector<ll> &v2) { 
    size_x12 = v1.size() + v2.size() - 1;
    x1 = v1; x2 = v2;
    size = 1; while (size<=size_x12) size<<=1;
    root = modpow(3,MOD/size);
    x1.resize(size); x2.resize(size); theta.resize(size);
    rep(i,size) theta[i] = i==0 ? 1 : theta[i-1]*root % MOD;
  }

  vector<ll> convolution(vector<ll> &x, bool rev, ll s, ll pos=0) {
    if (s==1) return {x[pos]};
    vector<ll> ex = convolution(x,rev,s/2,pos), ox = convolution(x,rev,s/2,pos+size/s);
    vector<ll> result(s);
    rep(i,s) result[i] = (ex[i%(s/2)] + theta[size/s*i] * ox[i%(s/2)]) % MOD;
    if (rev && s==size) {
      reverse(result.begin()+1, result.end());
      ll invs = inv(size);
      for (auto &x: result) x = x * invs % MOD;
    }
    return result;
  };

  vector<ll> mul(vector<ll> &v1, vector<ll> &v2) {
    set(v1,v2);
    vector<ll> cx1 = convolution(x1, false, size), cx2 = convolution(x2, false, size);
    vector<ll> cx12(size); rep(i,size) cx12[i] = cx1[i] * cx2[i] % MOD;
    vector<ll> x12 = convolution(cx12, true, size);
    vector<ll> result(size_x12); copy(x12.begin(), x12.begin()+size_x12, result.begin());
    return result;
  }

};

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

int main() {
  ll N, Q; cin >> N >> Q;
  ll a[N]; rep(i,N) cin >> a[i];
  ll r[Q]; rep(i,Q) cin >> r[i];
  vector<ll> cr(N); rep(i,Q) cr[(N-r[i])%N]++;

  vector<ll> aa(N*2); rep(i,N) { aa[i] = a[i]; aa[i+N] = a[i]; }
  FastNumberTheoreticTransform FNTT;
  vector<ll> result = FNTT.mul(aa,cr);
  // debug(all(result));
  debug(result.begin()+N,result.begin()+N*2);
  return 0;
}
0