結果

問題 No.941 商とあまり
ユーザー PachicobuePachicobue
提出日時 2019-12-11 02:21:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,871 bytes
コンパイル時間 2,652 ms
コンパイル使用メモリ 223,840 KB
実行使用メモリ 5,192 KB
最終ジャッジ日時 2023-09-06 11:53:25
合計ジャッジ時間 13,433 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 3 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 39 ms
4,376 KB
testcase_11 AC 39 ms
4,376 KB
testcase_12 AC 25 ms
4,376 KB
testcase_13 AC 24 ms
4,380 KB
testcase_14 AC 25 ms
4,376 KB
testcase_15 AC 658 ms
5,192 KB
testcase_16 AC 611 ms
5,060 KB
testcase_17 AC 24 ms
4,380 KB
testcase_18 AC 24 ms
4,380 KB
testcase_19 AC 24 ms
4,376 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 1 ms
4,380 KB
testcase_24 AC 1 ms
4,380 KB
testcase_25 AC 1 ms
4,380 KB
testcase_26 AC 49 ms
4,376 KB
testcase_27 AC 58 ms
4,376 KB
testcase_28 AC 24 ms
4,376 KB
testcase_29 AC 420 ms
4,572 KB
testcase_30 AC 420 ms
4,540 KB
testcase_31 AC 24 ms
4,376 KB
testcase_32 WA -
testcase_33 AC 2 ms
4,376 KB
testcase_34 AC 23 ms
4,380 KB
testcase_35 AC 23 ms
4,380 KB
testcase_36 AC 24 ms
4,376 KB
testcase_37 AC 49 ms
4,376 KB
testcase_38 AC 48 ms
4,380 KB
testcase_39 AC 23 ms
4,380 KB
testcase_40 AC 2 ms
4,376 KB
testcase_41 AC 2 ms
4,380 KB
testcase_42 AC 2 ms
4,380 KB
testcase_43 AC 24 ms
4,380 KB
testcase_44 AC 48 ms
4,376 KB
testcase_45 AC 89 ms
4,380 KB
testcase_46 AC 69 ms
4,380 KB
testcase_47 AC 25 ms
4,376 KB
testcase_48 AC 2 ms
4,376 KB
testcase_49 AC 187 ms
4,380 KB
testcase_50 AC 87 ms
4,380 KB
testcase_51 AC 123 ms
4,376 KB
testcase_52 AC 64 ms
4,376 KB
testcase_53 AC 73 ms
4,380 KB
testcase_54 AC 133 ms
4,376 KB
testcase_55 AC 130 ms
4,380 KB
testcase_56 AC 131 ms
4,380 KB
testcase_57 AC 23 ms
4,376 KB
testcase_58 AC 23 ms
4,380 KB
testcase_59 AC 25 ms
4,380 KB
testcase_60 AC 24 ms
4,380 KB
testcase_61 AC 26 ms
4,376 KB
testcase_62 AC 23 ms
4,376 KB
testcase_63 AC 24 ms
4,380 KB
testcase_64 AC 25 ms
4,376 KB
testcase_65 AC 24 ms
4,376 KB
testcase_66 AC 54 ms
4,380 KB
testcase_67 AC 24 ms
4,380 KB
testcase_68 AC 49 ms
4,380 KB
testcase_69 AC 24 ms
4,376 KB
testcase_70 AC 24 ms
4,380 KB
testcase_71 AC 67 ms
4,380 KB
testcase_72 AC 67 ms
4,376 KB
testcase_73 AC 24 ms
4,376 KB
testcase_74 AC 25 ms
4,380 KB
testcase_75 AC 25 ms
4,376 KB
testcase_76 AC 25 ms
4,380 KB
testcase_77 AC 24 ms
4,380 KB
testcase_78 AC 24 ms
4,376 KB
testcase_79 AC 25 ms
4,380 KB
testcase_80 AC 25 ms
4,380 KB
testcase_81 AC 24 ms
4,376 KB
testcase_82 AC 25 ms
4,376 KB
testcase_83 AC 24 ms
4,376 KB
testcase_84 AC 24 ms
4,376 KB
testcase_85 AC 24 ms
4,376 KB
testcase_86 AC 24 ms
4,380 KB
testcase_87 AC 24 ms
4,376 KB
testcase_88 AC 24 ms
4,376 KB
testcase_89 AC 24 ms
4,380 KB
testcase_90 AC 24 ms
4,376 KB
testcase_91 AC 24 ms
4,380 KB
testcase_92 AC 25 ms
4,380 KB
testcase_93 AC 24 ms
4,376 KB
testcase_94 AC 23 ms
4,384 KB
testcase_95 AC 24 ms
4,376 KB
testcase_96 AC 24 ms
4,376 KB
testcase_97 AC 25 ms
4,376 KB
testcase_98 AC 2 ms
4,380 KB
testcase_99 AC 24 ms
4,380 KB
testcase_100 AC 23 ms
4,380 KB
testcase_101 AC 2 ms
4,380 KB
testcase_102 AC 2 ms
4,380 KB
testcase_103 AC 23 ms
4,376 KB
testcase_104 AC 2 ms
4,376 KB
testcase_105 AC 1 ms
4,376 KB
testcase_106 AC 2 ms
4,376 KB
testcase_107 AC 1 ms
4,380 KB
testcase_108 AC 1 ms
4,376 KB
testcase_109 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2019/12/11] 00:33:01
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
} hogechan;
template<typename T>
void out(const T& v) { std::cout << v << '\n'; }  // Reactiveではstd::flushを忘れない
template<typename T, typename... Args>
void out(const T& v, const Args... args) { std::cout << v << ' ', out(args...); }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    const auto [N, X] = in_t<int, int>();
    auto A            = in_v<int>({N});
    std::sort(A.begin(), A.end());
    {
        int Y = X + 1;
        for (const int e : A) { Y /= (e + 1); }
        if (Y == 0) {
            out(std::string(X, '0'));
            return 0;
        }
    }
    if (N == 1) {
        std::string ans(X, '0');
        ans[A[0] - 1] = '1';
        std::cout << ans << std::endl;
        return 0;
    }
    const int g = std::accumulate(A.begin(), A.end(), 0, [](int a, int b) { return std::gcd(a, b); });
    if (A[0] == g) {
        int Y = 1;
        for (const int e : A) { Y *= (e + 1); }
        Y--;
        for (int x = 1; x <= X; x++) { std::cout << (x >= Y and (x - Y) % g == 0); }
        std::cout << std::endl;
        return 0;
    }
    const int M = 1 << N;
    std::vector<int> prod(M, 1);
    std::vector<int> max(M);
    for (int m = 0; m < M; m++) {
        for (int i = 0; i < N; i++) {
            if (btest(m, i)) { prod[m] *= (A[i] + 1); }
        }
    }
    for (int m = 0; m < M; m++) { max[m] = (X + 1) / prod[M - 1 - m] - 1; }

    std::set<std::vector<int>> st;
    std::vector<int> ms;
    for (int m = 0; m < M; m++) {
        std::vector<int> v;
        for (int i = 0; i < N; i++) {
            if (btest(m, i)) { v.push_back(i); }
        }
        std::sort(v.begin(), v.end());
        if (st.count(v)) { continue; }
        st.insert(v), ms.push_back(m);
    }

    std::vector<std::vector<bool>> dp(M);
    for (int m = 0; m < M; m++) { dp[m].resize(max[m] + 1); }
    dp[0][0] = true;
    for (const int m : ms) {
        std::vector<bool> nxt(dp[m].size(), false);
        for (int i = 0; i < N; i++) {
            if (not btest(m, i)) { continue; }
            const int a  = A[i];
            const int pm = m - (1 << i);
            for (int px = 0; px < dp[pm].size(); px++) {
                if (not dp[pm][px]) { continue; }
                ll nx = (ll)a * (px + 1) + px;
                if (nx >= nxt.size()) { break; }
                nxt[nx] = true;
            }
            if (m > 0) {
                for (int x = a; x < nxt.size(); x++) { nxt[x] = nxt[x] | nxt[x - a]; }
            }
            for (int x = 0; x < nxt.size(); x++) { dp[m][x] = dp[m][x] | nxt[x]; }
            std::fill(nxt.begin(), nxt.end(), false);
        }
    }
    for (int x = 1; x <= X; x++) { std::cout << dp[M - 1][x]; }
    std::cout << std::endl;
    return 0;
}
0