結果

問題 No.1861 Required Number
ユーザー iiljjiiljj
提出日時 2022-03-04 21:56:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 603 ms / 2,500 ms
コード長 12,194 bytes
コンパイル時間 1,649 ms
コンパイル使用メモリ 158,908 KB
実行使用メモリ 316,880 KB
最終ジャッジ日時 2024-07-18 22:49:16
合計ジャッジ時間 14,806 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 506 ms
316,880 KB
testcase_04 AC 487 ms
316,756 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 4 ms
6,944 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 3 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 4 ms
6,940 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 3 ms
6,944 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 AC 2 ms
6,940 KB
testcase_18 AC 4 ms
6,944 KB
testcase_19 AC 6 ms
6,944 KB
testcase_20 AC 5 ms
6,940 KB
testcase_21 AC 2 ms
6,940 KB
testcase_22 AC 6 ms
6,944 KB
testcase_23 AC 2 ms
6,944 KB
testcase_24 AC 227 ms
108,228 KB
testcase_25 AC 596 ms
272,820 KB
testcase_26 AC 103 ms
47,084 KB
testcase_27 AC 204 ms
97,144 KB
testcase_28 AC 246 ms
113,464 KB
testcase_29 AC 136 ms
64,344 KB
testcase_30 AC 31 ms
14,824 KB
testcase_31 AC 603 ms
277,560 KB
testcase_32 AC 49 ms
23,612 KB
testcase_33 AC 409 ms
188,832 KB
testcase_34 AC 486 ms
223,944 KB
testcase_35 AC 501 ms
227,300 KB
testcase_36 AC 142 ms
67,988 KB
testcase_37 AC 234 ms
107,504 KB
testcase_38 AC 506 ms
231,812 KB
testcase_39 AC 273 ms
126,816 KB
testcase_40 AC 599 ms
276,044 KB
testcase_41 AC 572 ms
260,464 KB
testcase_42 AC 455 ms
210,520 KB
testcase_43 AC 241 ms
111,324 KB
testcase_44 AC 2 ms
6,944 KB
04_evil_1.txt MLE -
04_evil_2.txt MLE -
04_evil_3.txt MLE -
04_evil_4.txt MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<<<N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<<<0, true>(cout, a); }

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region BFS */

/**
 * @param N ノード数
 * @param delta 隣接行列を生成する関数．delta(Node v, fn(Node t)).
 *              fn は現在の頂点 current と隣接する頂点を探索する関数．
 * @param index 頂点→頂点インデックス，のマップ関数．（index(Node v) -> int）
 * @return 距離テーブル，到達不能な箇所は -1 で埋まっている
 */
template <typename T = ll, class Node, class Delta, class Index>
pair<vc<T>, vc<int>> bfs(const int N, const vc<Node> &starts, Delta delta, Index index) {
    vc<T> dist(N, -1);   // 距離テーブル
    vc<int> prev(N, -1); // 直前のノード
    queue<Node> que;     // 「訪問予定」頂点リスト
    for (const Node &start : starts) {
        dist[index(start)] = 0; // 初期条件 (頂点 idx1 を初期頂点とする)
        que.push(start);
    }
    // BFS 開始 (キューが空になるまで探索を行う)
    while (!que.empty()) {
        const Node current = que.front();
        que.pop();
        // 隣接ノードに関するループは外に出す
        delta(current, [&](const Node &dst) {
            const int nxt_idx = index(dst);
            if (dist[nxt_idx] == -1) {
                const int cur_idx = index(current);
                dist[nxt_idx] = dist[cur_idx] + 1;
                prev[nxt_idx] = cur_idx;
                que.push(dst);
            }
        });
    }
    return {dist, prev};
}

/* #endregion */

// Problem
void solve() {
    VAR(ll, n, k); //
    vll a(n);
    cin >> a;
    sort(ALL(a));

    vc<vc<int>> table(n, vc<int>(k + 1, 0)); // i 番目を選ばずに和を j にできるか
    using Node = pair<int, int>;             // i番目まで見て和が j
    // 隣接行列生成関数
    auto delta = [&](Node current, function<void(Node)> transit) {
        auto [i, j] = current;
        if (i == n) return;
        transit(Node(i + 1, j));
        table[i][j] = 1;
        if (j + a[i] <= k) {
            transit(Node(i + 1, j + a[i]));
        }
    };
    // インデックス生成関数
    auto index = [&](Node v) { return v.first * (k + 1) + v.second; };

    Node start = {0, 0};
    vc<Node> starts = {start};
    auto [dist, prev] = bfs<int>((n + 1) * (k + 1), starts, delta, index); // BFS 実行

    if (dist[index(Node(n, k))] == -1) {
        pprint(-1);
        return;
    }
    // dump(dist);
    // dump(table);

    vc<vc<int>> table2(n, vc<int>(k + 1, 0)); // i 番目を選ばずに和を j にできるか
    auto delta2 = [&](Node current, function<void(Node)> transit) {
        auto [i, j] = current;
        if (i == 0) return;
        transit(Node(i - 1, j));
        table2[i - 1][j] = 1;
        if (j - a[i - 1] >= 0) {
            transit(Node(i - 1, j - a[i - 1]));
        }
    };
    Node start2 = {n, k};
    vc<Node> starts2 = {start2};
    auto [dist2, prev2] = bfs<int>((n + 1) * (k + 1), starts2, delta2, index); // BFS 実行

    // 選ばずに通り過ぎる経路が1つも存在しない → 選ばざるを得ない
    // 選ばずに通り過ぎる経路が1つ以上存在する → 選ばなくてもよい
    ll ans = 0;
    REP(i, 0, n) {
        bool path_exists = false;
        REPM(j, 0, k) {
            if (table[i][j] == 1 && table2[i][j] == 1) {
                path_exists = true;
                break;
            }
        }
        if (!path_exists) ans++;
    }
    pprint(ans);
}

// entry point
int main() {
    solve();
    return 0;
}
0