結果

問題 No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)
ユーザー Enjapma_kyoproEnjapma_kyopro
提出日時 2020-05-30 04:14:36
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,627 ms / 3,500 ms
コード長 4,719 bytes
コンパイル時間 1,781 ms
コンパイル使用メモリ 179,624 KB
実行使用メモリ 18,464 KB
最終ジャッジ日時 2023-08-06 17:10:07
合計ジャッジ時間 33,091 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 22 ms
4,376 KB
testcase_04 AC 16 ms
4,376 KB
testcase_05 AC 18 ms
4,376 KB
testcase_06 AC 14 ms
4,380 KB
testcase_07 AC 12 ms
4,376 KB
testcase_08 AC 17 ms
4,380 KB
testcase_09 AC 19 ms
4,380 KB
testcase_10 AC 9 ms
4,380 KB
testcase_11 AC 12 ms
4,380 KB
testcase_12 AC 7 ms
4,384 KB
testcase_13 AC 1,579 ms
18,392 KB
testcase_14 AC 1,621 ms
18,464 KB
testcase_15 AC 1,610 ms
18,392 KB
testcase_16 AC 1,615 ms
18,328 KB
testcase_17 AC 1,610 ms
18,388 KB
testcase_18 AC 1,615 ms
18,280 KB
testcase_19 AC 1,608 ms
18,272 KB
testcase_20 AC 1,603 ms
18,256 KB
testcase_21 AC 1,613 ms
18,348 KB
testcase_22 AC 1,607 ms
18,392 KB
testcase_23 AC 1,611 ms
18,412 KB
testcase_24 AC 1,608 ms
18,460 KB
testcase_25 AC 1,613 ms
18,392 KB
testcase_26 AC 1,612 ms
18,316 KB
testcase_27 AC 1,623 ms
18,388 KB
testcase_28 AC 1,627 ms
18,392 KB
testcase_29 AC 1,614 ms
18,356 KB
testcase_30 AC 1,606 ms
18,260 KB
testcase_31 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
 
long long int INF = 2e18;
const ll fact_table = 3200008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←

#define endl "\n"
#ifdef ENJAPMA
    #undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";

long double timers[10];

struct Timer {
    int64_t start;
    const int64_t CYCLES_PER_SEC=2800000000;
    Timer() { reset(); }
    void reset() { start = getCycle(); }
    inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
    inline int64_t getCycle() {
        uint32_t low, high;
        __asm__ volatile ("rdtsc" : "=a" (low), "=d" (high));
        return ((int64_t)low) | ((int64_t)high << 32);
    }
};

Timer timer;
 
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
ll mypow(ll a, ll b, ll mod){ll x=1;while(b){while(!(b&1)){(a*=a)%=mod;b>>=1;}(x*=a)%=mod;b--;}return x;}

void YES(bool cond){ if(cond){ p("YES");}else{ p("NO");} return;}
void Yes(bool cond){ if(cond){ p("Yes");}else{ p("No");} return;}

namespace NTT {
  void DFT(ll m, ll root, vector<ll> &a, bool rev = false) {
    long double start = timer.get();
    ll N = a.size(), h = 0;
 
    for (ll i = 0; 1 << i < N; i++) h++;
    for (ll i = 0; i < N; i++) {
      ll j = 0;
      for (ll k = 0; k < h; k++)
        j |= (i >> k & 1) << (h - 1 - k);
      if (i < j) swap(a[i], a[j]);
    }
    long double end = timer.get();
    timers[0] += end - start;
 
    if (rev) root = mypow(root, mod - 2, mod);

    for (ll i = 1; i < N; i *= 2) {
      ll tmp = i * 2;
      ll base = mypow(root, (mod - 1) / tmp, mod);
      ll w = 1;
      for (ll j = 0; j < i; j++) {
        for (ll k = j; k + i < N; k += tmp) {
          ll s = a[k], t = a[k+i] * w % mod;
          a[k] = (s + t) % mod;
          a[k+i] = (s - t + mod) % mod;
        }
        (w *= base) %= mod;
      }
    }

    long double end2 = timer.get();
    timers[1] += end2 - end;
 
    if (rev) {
      ll tmp = mypow(N, mod-2, mod);
      for(ll &v : a) v = v * tmp % mod;
    }
    long double end3 = timer.get();
    timers[2] += end3 - end2;

  }
 
  //(1012924417, 5), (924844033, 5)
 
  vector<ll> conv(ll _mod, ll root, const vector<ll> &a, const vector<ll> &b) {
    ll s = 1, t = a.size() + b.size() - 1;
    while(s < t) s <<= 1;
 
    vector<ll> F(s), G(s);
    ll aa = (ll)a.size(), bb = (ll)b.size();
    for(ll i = 0; i < aa; i++) F[i] = a[i];
    for(ll i = 0; i < bb; i++) G[i] = b[i];
    DFT(_mod, root, F); DFT(_mod, root, G);
 
    for(ll i = 0; i < s; i++) (F[i] *= G[i]) %= _mod;
    DFT(_mod, root, F, true);
    // pe(F.size());p(t);
    F.resize(t);
    return F;
  }
};



// auto res = NTT::conv(mod, 3ll, atable, btable);

/*
ll fact[fact_table + 5],rfact[fact_table + 5]; 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

bool multicase = false;

ll n,m,num,a,b,c,d,e,h,q;
ll w, k, ans;

deque<vector<ll>> G;
vector<ll> v;

void solve(){
    cin >> n >> q;
    timer.reset();
    for(ll i=0;i<n;i++){
        cin >> a;
        a %= mod;
        if(a == 0)a += mod;
        G.pb({1, a-1});
    }
    while(G.size() >= 2){
        // 分割統治パート
        G.pb(NTT::conv(mod, 3ll, G[0], G[1]));
        G.pop_front();
        G.pop_front();
    }
    for(ll i=0;i<q;i++){
        cin >> b;
        p(G[0][n-b]);
    }
    return;
}


int main(){
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if(multicase){
        cin >> q;
    }else{
        q = 1; 
    }
    while(q--){
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}
0