結果

問題 No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)
ユーザー minatominato
提出日時 2020-10-07 01:02:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 315 ms / 3,500 ms
コード長 4,400 bytes
コンパイル時間 6,357 ms
コンパイル使用メモリ 317,872 KB
実行使用メモリ 14,772 KB
最終ジャッジ日時 2023-09-27 09:03:36
合計ジャッジ時間 13,612 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 6 ms
4,380 KB
testcase_04 AC 4 ms
4,380 KB
testcase_05 AC 5 ms
4,380 KB
testcase_06 AC 4 ms
4,380 KB
testcase_07 AC 4 ms
4,380 KB
testcase_08 AC 5 ms
4,376 KB
testcase_09 AC 5 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 3 ms
4,376 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 303 ms
14,500 KB
testcase_14 AC 300 ms
14,504 KB
testcase_15 AC 303 ms
14,608 KB
testcase_16 AC 297 ms
14,616 KB
testcase_17 AC 302 ms
14,492 KB
testcase_18 AC 300 ms
14,668 KB
testcase_19 AC 298 ms
14,504 KB
testcase_20 AC 301 ms
14,732 KB
testcase_21 AC 295 ms
14,508 KB
testcase_22 AC 295 ms
14,596 KB
testcase_23 AC 306 ms
14,492 KB
testcase_24 AC 310 ms
14,508 KB
testcase_25 AC 304 ms
14,772 KB
testcase_26 AC 313 ms
14,512 KB
testcase_27 AC 315 ms
14,544 KB
testcase_28 AC 305 ms
14,508 KB
testcase_29 AC 297 ms
14,536 KB
testcase_30 AC 297 ms
14,560 KB
testcase_31 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t &x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template<class T> 
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    for(auto e : v) os << e << ", ";
    return os << "]";
}
template<class Container> inline int SZ(Container& v) {return int(v.size());}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}
namespace detail {
    template<typename Tp, int Nb>
    auto make_vector(vector<int>& sizes, Tp const& x) {
        if constexpr (Nb == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[Nb-1];
            sizes.pop_back();
            return vector(size, make_vector<Tp, Nb-1>(sizes, x));
        }
    }
}
template<typename Tp, int Nb>
auto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {
    vector<int> s(Nb);
    for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];
    return detail::make_vector<Tp, Nb>(s, x);
}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T>& v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;

int main() {
    int N,Q; cin >> N >> Q;
    queue<vector<mint>> que;
    rep(i,N) {
        ll a; cin >> a;
        que.emplace(vector<mint>{a-1,1});
    }

    while (que.size() >= 2) {
        auto x = que.front(); que.pop();
        auto y = que.front(); que.pop();
        auto z = convolution(x,y);
        que.emplace(z);
    }
    auto dp = que.front(); que.pop();
    rep(_,Q) {
        int x; cin >> x;
        cout << dp[x].val() << ln;
    }
}
0