結果

問題 No.941 商とあまり
ユーザー yosupotyosupot
提出日時 2019-12-04 02:27:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,935 bytes
コンパイル時間 2,524 ms
コンパイル使用メモリ 208,888 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-05-06 09:05:38
合計ジャッジ時間 9,940 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 3 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 8 ms
5,376 KB
testcase_08 AC 8 ms
5,376 KB
testcase_09 AC 8 ms
5,376 KB
testcase_10 WA -
testcase_11 AC 20 ms
5,376 KB
testcase_12 AC 23 ms
5,376 KB
testcase_13 AC 3 ms
5,376 KB
testcase_14 AC 376 ms
5,376 KB
testcase_15 AC 308 ms
5,376 KB
testcase_16 AC 214 ms
5,376 KB
testcase_17 AC 4 ms
5,376 KB
testcase_18 AC 4 ms
5,376 KB
testcase_19 AC 3 ms
5,376 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 3 ms
5,376 KB
testcase_22 AC 3 ms
5,376 KB
testcase_23 AC 1 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 1 ms
5,376 KB
testcase_26 AC 45 ms
5,376 KB
testcase_27 AC 50 ms
5,376 KB
testcase_28 AC 386 ms
5,376 KB
testcase_29 AC 315 ms
5,376 KB
testcase_30 AC 321 ms
5,376 KB
testcase_31 AC 304 ms
5,376 KB
testcase_32 AC 3 ms
5,376 KB
testcase_33 AC 3 ms
5,376 KB
testcase_34 AC 3 ms
5,376 KB
testcase_35 AC 3 ms
5,376 KB
testcase_36 AC 19 ms
5,376 KB
testcase_37 AC 19 ms
5,376 KB
testcase_38 AC 10 ms
5,376 KB
testcase_39 AC 4 ms
5,376 KB
testcase_40 AC 3 ms
5,376 KB
testcase_41 AC 4 ms
5,376 KB
testcase_42 AC 3 ms
5,376 KB
testcase_43 AC 7 ms
5,376 KB
testcase_44 AC 7 ms
5,376 KB
testcase_45 AC 87 ms
5,376 KB
testcase_46 AC 75 ms
5,376 KB
testcase_47 AC 150 ms
5,376 KB
testcase_48 AC 3 ms
5,376 KB
testcase_49 AC 68 ms
5,376 KB
testcase_50 AC 5 ms
5,376 KB
testcase_51 AC 4 ms
5,376 KB
testcase_52 AC 3 ms
5,376 KB
testcase_53 AC 4 ms
5,376 KB
testcase_54 AC 112 ms
5,376 KB
testcase_55 AC 81 ms
5,376 KB
testcase_56 AC 97 ms
5,376 KB
testcase_57 AC 3 ms
5,376 KB
testcase_58 AC 4 ms
5,376 KB
testcase_59 AC 10 ms
5,376 KB
testcase_60 AC 10 ms
5,376 KB
testcase_61 AC 8 ms
5,376 KB
testcase_62 AC 4 ms
5,376 KB
testcase_63 AC 4 ms
5,376 KB
testcase_64 AC 3 ms
5,376 KB
testcase_65 AC 4 ms
5,376 KB
testcase_66 AC 27 ms
5,376 KB
testcase_67 AC 4 ms
5,376 KB
testcase_68 AC 28 ms
5,376 KB
testcase_69 AC 4 ms
5,376 KB
testcase_70 AC 4 ms
5,376 KB
testcase_71 AC 52 ms
5,376 KB
testcase_72 AC 51 ms
5,376 KB
testcase_73 AC 4 ms
5,376 KB
testcase_74 AC 4 ms
5,376 KB
testcase_75 AC 4 ms
5,376 KB
testcase_76 AC 4 ms
5,376 KB
testcase_77 AC 4 ms
5,376 KB
testcase_78 AC 4 ms
5,376 KB
testcase_79 AC 4 ms
5,376 KB
testcase_80 AC 4 ms
5,376 KB
testcase_81 AC 4 ms
5,376 KB
testcase_82 AC 4 ms
5,376 KB
testcase_83 AC 3 ms
5,376 KB
testcase_84 AC 4 ms
5,376 KB
testcase_85 AC 4 ms
5,376 KB
testcase_86 AC 3 ms
5,376 KB
testcase_87 AC 3 ms
5,376 KB
testcase_88 AC 4 ms
5,376 KB
testcase_89 AC 4 ms
5,376 KB
testcase_90 AC 4 ms
5,376 KB
testcase_91 AC 3 ms
5,376 KB
testcase_92 AC 4 ms
5,376 KB
testcase_93 AC 4 ms
5,376 KB
testcase_94 AC 3 ms
5,376 KB
testcase_95 AC 4 ms
5,376 KB
testcase_96 AC 3 ms
5,376 KB
testcase_97 AC 3 ms
5,376 KB
testcase_98 AC 3 ms
5,376 KB
testcase_99 AC 3 ms
5,376 KB
testcase_100 AC 3 ms
5,376 KB
testcase_101 AC 3 ms
5,376 KB
testcase_102 AC 3 ms
5,376 KB
testcase_103 AC 4 ms
5,376 KB
testcase_104 AC 2 ms
5,376 KB
testcase_105 AC 2 ms
5,376 KB
testcase_106 AC 2 ms
5,376 KB
testcase_107 AC 1 ms
5,376 KB
testcase_108 AC 2 ms
5,376 KB
testcase_109 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

# 1 "main.cpp"
# 1 "<built-in>"
# 1 "<command-line>"
# 1 "main.cpp"



# 1 "/Users/yosupo/Programs/Algorithm/expander/dummy_include/bits/stdc++.h" 1
       

#include <bits/stdc++.h>
# 5 "main.cpp" 2
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

# 1 "/Users/yosupo/Programs/Algorithm/src/util/fast_io.h" 1
       
struct Scanner {
    FILE* fp = nullptr;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += fread(line + ed, 1, (1 << 15) - ed, fp);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            succ();
            size_t sz = 1;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (st != ed) break;
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    void write_single(const T& val) {
        for (char c : val) write_single(c);
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val;
        }
        size_t len = 0;
        while (val) {
            small[len++] = char('0' + (val % 10));
            val /= 10;
        }
        reverse(small, small + len);
        memcpy(line + pos, small, len);
        pos += len;
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};
# 15 "main.cpp" 2
# 40 "main.cpp"
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "P(" << p.first << ", " << p.second << ")";
}

template <class T> ostream& operator<<(ostream& os, const V<T>& v) {
    os << "[";
    for (auto d : v) os << d << ", ";
    return os << "]";
}

# 1 "/Users/yosupo/Programs/Algorithm/src/bitop.h" 1
       

int popcnt(uint x) { return __builtin_popcount(x); }
int popcnt(ull x) { return __builtin_popcountll(x); }
int bsr(uint x) { return 31 - __builtin_clz(x); }
int bsr(ull x) { return 63 - __builtin_clzll(x); }
int bsf(uint x) { return __builtin_ctz(x); }
int bsf(ull x) { return __builtin_ctzll(x); }
# 52 "main.cpp" 2
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

V<bool> solve(ll m, V<ll> v) {
    int n = int(v.size());
    V<bool> ans(m + 1);
    if (n == 1) {
        ans[v[0]] = true;
        return ans;
    }

    ll mi = 1, md = TEN(9);
    for (ll d : v) {
        md = min(md, d - 1);
        mi *= d;
        if (mi > m) break;
    }
    if (mi > m) {
        return ans;
    }
    if (md == 1) {
        for (ll i = mi; i <= m; i++) ans[i] = true;
        return ans;
    }
    if (n == 2) {
        for (ll d: v) {
            for (ll i = mi; i <= m; i += d - 1) ans[i] = true;
        }
        return ans;
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (ll x = mi; x <= m; x += (v[i] * v[j] - 1)) {
                ans[x] = true;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            ll f0 = (v[i] - 1);
            ll f1 = v[i] * (v[j] - 1);
            for (int c = 0; c < f0; c++) {
                ll base = mi + f1 * c;
                if (base > m) break;
                for (ll x = base; x <= m; x += f0) {
                    ans[x] = true;
                }
            }
        }
        if (n >= 4) {
            for (int j = 0; j < n; j++) {
                if (i == j) continue;
                for (int k = j + 1; k < n; k++) {
                    if (i == k) continue;
                    ll f0 = (v[i] - 1);
                    ll f1 = v[i] * (v[j] * v[k] - 1);
                    for (int c = 0; c < f0; c++) {
                        ll base = mi + f1 * c;
                        if (base > m) break;
                        for (ll x = base; x <= m; x += f0) {
                            ans[x] = true;
                        }
                    }
                }
            }
        }
    }
    return ans;
}

int main() {
    Scanner sc = Scanner(stdin);
    Printer pr = Printer(stdout);
    int n; ll x;
    sc.read(n, x);
    V<ll> a(n);
    sc.read(a);
    for (ll& d: a) d++;
    auto ans = solve(x + 1, a);
    for (int i = 2; i <= x + 1; i++) {
        auto f = ans[i];
        pr.write(f ? '1' : '0');
    }
    pr.writeln();
    return 0;
}
0