結果

問題 No.1782 ManyCoins
ユーザー satashunsatashun
提出日時 2023-08-08 23:45:50
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 352 ms / 2,000 ms
コード長 11,353 bytes
コンパイル時間 2,372 ms
コンパイル使用メモリ 213,620 KB
実行使用メモリ 28,496 KB
最終ジャッジ日時 2024-11-14 04:58:03
合計ジャッジ時間 7,247 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 3 ms
6,816 KB
testcase_02 AC 1 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 2 ms
6,816 KB
testcase_09 AC 2 ms
6,816 KB
testcase_10 AC 2 ms
6,816 KB
testcase_11 AC 2 ms
6,820 KB
testcase_12 AC 2 ms
6,820 KB
testcase_13 AC 33 ms
10,968 KB
testcase_14 AC 271 ms
19,892 KB
testcase_15 AC 148 ms
14,204 KB
testcase_16 AC 189 ms
14,616 KB
testcase_17 AC 259 ms
19,560 KB
testcase_18 AC 199 ms
15,344 KB
testcase_19 AC 2 ms
6,816 KB
testcase_20 AC 238 ms
18,828 KB
testcase_21 AC 278 ms
20,204 KB
testcase_22 AC 352 ms
27,804 KB
testcase_23 AC 304 ms
19,352 KB
testcase_24 AC 7 ms
11,072 KB
testcase_25 AC 339 ms
28,200 KB
testcase_26 AC 143 ms
10,432 KB
testcase_27 AC 341 ms
28,496 KB
testcase_28 AC 7 ms
10,992 KB
testcase_29 AC 30 ms
10,984 KB
testcase_30 AC 32 ms
10,992 KB
testcase_31 AC 42 ms
10,996 KB
testcase_32 AC 47 ms
11,096 KB
testcase_33 AC 70 ms
11,048 KB
testcase_34 AC 93 ms
11,068 KB
testcase_35 AC 121 ms
10,864 KB
testcase_36 AC 27 ms
11,000 KB
testcase_37 AC 9 ms
10,752 KB
testcase_38 AC 6 ms
11,064 KB
testcase_39 AC 4 ms
6,820 KB
testcase_40 AC 6 ms
10,744 KB
testcase_41 AC 5 ms
9,196 KB
testcase_42 AC 6 ms
10,328 KB
testcase_43 AC 5 ms
8,860 KB
testcase_44 AC 6 ms
10,908 KB
testcase_45 AC 6 ms
9,852 KB
testcase_46 AC 15 ms
6,816 KB
testcase_47 AC 14 ms
6,820 KB
testcase_48 AC 2 ms
6,820 KB
testcase_49 AC 2 ms
6,816 KB
testcase_50 AC 7 ms
10,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region satashun
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template <typename T, typename V>
void fill_vec(T& v, const V& val) {
    v = val;
}

template <typename T, typename V>
void fill_vec(vector<T>& vec, const V& val) {
    for (auto& v : vec) fill_vec(v, val);
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <typename T>
int arglb(const V<T>& v, const T& x) {
    return distance(v.begin(), lower_bound(ALL(v), x));
}

template <typename T>
int argub(const V<T>& v, const T& x) {
    return distance(v.begin(), upper_bound(ALL(v), x));
}

template <class T>
void mkuni(vector<T>& v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), end(v));
}

template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
    vector<int> res(v.size());
    iota(res.begin(), res.end(), 0);

    if (increasing) {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] < v[j]; });
    } else {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] > v[j]; });
    }
    return res;
}

// prototype
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p);

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v);

template <class T>
istream& operator>>(istream& is, vector<T>& v);

template <class T, size_t sz>
ostream& operator<<(ostream& os, const array<T, sz>& arr);

template <class T>
ostream& operator<<(ostream& os, const set<T>& ST);

template <class T>
ostream& operator<<(ostream& os, const multiset<T>& ST);

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP);

ostream& operator<<(ostream& o, __int128_t x);

// io functions
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) {
        is >> x;
    }
    return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

template <class T, size_t sz>
ostream& operator<<(ostream& os, const array<T, sz>& arr) {
    os << '[';
    for (auto v : arr) os << v << ',';
    os << ']';
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const set<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const multiset<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP) {
    for (auto it = MP.begin(); it != MP.end(); ++it) {
        os << "(" << it->first << ": " << it->second << ")";
    }
    return os;
}

string to_string(__int128_t x) {
    if (x == 0) return "0";
    string result;
    if (x < 0) {
        result += "-";
        x *= -1;
    }
    string t;
    while (x) {
        t.push_back('0' + x % 10);
        x /= 10;
    }
    reverse(t.begin(), t.end());
    return result + t;
}

ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); }

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
V<T>& operator+=(V<T>& vec, const T& v) {
    for (auto& x : vec) x += v;
    return vec;
}

template <class T>
V<T>& operator-=(V<T>& vec, const T& v) {
    for (auto& x : vec) x -= v;
    return vec;
}

// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class T>
void show(T x) {
    print(x, 1);
}

template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
    print(H, 2);
    show(T...);
}

int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(int t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
int bit_parity(int t) { return __builtin_parity(t); }
int bit_parity(ll t) { return __builtin_parityll(t); }

struct prepare_io {
    prepare_io() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} prep_io;
#pragma endregion satashun

template <class T>
class Edge {
   public:
    int from, to, idx;
    T cost;

    Edge() = default;
    Edge(int from, int to, T cost = T(1), int idx = -1)
        : from(from), to(to), cost(cost), idx(idx) {}
    operator int() const { return to; }

    bool operator<(const Edge& e) const { return cost < e.cost; }
};

template <class T>
class Graph {
   public:
    using E = Edge<T>;
    vector<vector<E>> g;
    vector<E> edges;
    int es;

    Graph() {}
    Graph(int n) : g(n), edges(0), es(0){};

    int size() const { return g.size(); }

    virtual void add_directed_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es++);
    }

    virtual void add_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es);
        g[to].emplace_back(to, from, cost, es++);
    }

    inline vector<E>& operator[](const int& k) { return g[k]; }

    inline const vector<E>& operator[](const int& k) const { return g[k]; }

    void read(int M, int offset = -1, bool directed = false,
              bool weighted = false) {
        for (int i = 0; i < M; i++) {
            int a, b;
            cin >> a >> b;
            a += offset;
            b += offset;
            T c = T(1);
            if (weighted) cin >> c;
            edges.emplace_back(a, b, c, i);
            if (directed)
                add_directed_edge(a, b, c);
            else
                add_edge(a, b, c);
        }
    }
};

// ABC264G
template <class T>
V<T> bellman_ford(const Graph<T>& g, int s = 0) {
    const auto INF = numeric_limits<T>::max();
    int n = g.size();

    V<T> ds(n, INF);
    ds[s] = 0;

    rep(i, n) {
        rep(v, n) {
            for (auto& e : g[v]) {
                if (ds[e.from] == INF) continue;
                chmin(ds[e.to], ds[e.from] + e.cost);
            }
        }
    }

    rep(v, n) {
        for (auto& e : g[v]) {
            if (ds[e.from] == INF) continue;
            if (ds[e.from] + e.cost < ds[e.to]) return V<T>();
        }
    }
    return ds;
}

// cost = 1 or tree
template <class T>
V<T> bfs(const Graph<T>& g, int s = 0) {
    const T inf = numeric_limits<T>::max() / 2;
    int n = g.size();

    V<T> ds(n, inf);
    queue<int> que;
    que.push(s);
    ds[s] = 0;

    while (!que.empty()) {
        auto v = que.front();
        que.pop();
        for (auto e : g[v]) {
            T nx = ds[v] + e.cost;
            if (ds[e.to] > nx) {
                ds[e.to] = nx;
                que.push(e.to);
            }
        }
    }
    for (auto& x : ds)
        if (x == inf) x = -1;
    return ds;
}

// must be optimized
template <class T>
V<T> bfs01(const Graph<T>& g, int s = 0) {
    const T inf = numeric_limits<T>::max() / 2;
    int n = g.size();

    V<T> ds(n, inf);
    using P = pair<T, int>;
    deque<int> que;
    que.push_back(s);
    ds[s] = 0;

    while (!que.empty()) {
        auto v = que.front();
        que.pop_front();
        for (auto e : g[v]) {
            T nx = ds[v] + e.cost;
            if (ds[e.to] > nx) {
                ds[e.to] = nx;
                if (e.cost == 0) {
                    que.push_front(e.to);
                } else {
                    que.push_back(e.to);
                }
            }
        }
    }
    for (auto& x : ds)
        if (x == inf) x = -1;
    return ds;
}

template <class T>
V<T> dijkstra(const Graph<T>& g, int s = 0) {
    const T inf = numeric_limits<T>::max() / 2;
    int n = g.size();

    V<T> ds(n, inf);
    using P = pair<T, int>;
    priority_queue<P, V<P>, greater<P>> que;
    que.emplace(0, s);
    ds[s] = 0;
    while (!que.empty()) {
        auto p = que.top();
        que.pop();
        int v = p.se;
        if (ds[v] < p.fi) continue;
        for (auto e : g[v]) {
            T nx = ds[v] + e.cost;
            if (ds[e.to] > nx) {
                ds[e.to] = nx;
                que.emplace(nx, e.to);
            }
        }
    }
    for (auto& x : ds)
        if (x == inf) x = -1;
    return ds;
}

const ll INF = TEN(18);

void slv() {
    // input
    int N;
    ll L;
    cin >> N >> L;
    V<int> W(N);
    cin >> W;
    int M = *max_element(ALL(W));

    // solve

    V<ll> ds(M, INF);
    ds[0] = 0;
    using D = pair<ll, int>;
    priority_queue<D, V<D>, greater<D>> que;
    que.emplace(0ll, 0);
    while (!que.empty()) {
        auto [d, i] = que.top();
        que.pop();
        if (ds[i] < d) continue;
        for (int w : W) {
            int ni = (i + w) % M;
            if (ds[ni] > ds[i] + w) {
                ds[ni] = ds[i] + w;
                que.emplace(ds[ni], ni);
            }
        }
    }

    ll ans = 0;
    rep(i, M) {
        ll d = ds[i];
        if (d == INF) continue;
        if (i == 0) d = M;

        if (d <= L) {
            ans += (L - d) / M + 1;
        }
    }
    show(ans);
}

int main() {
    int cases = 1;
    // cin >> cases;
    rep(i, cases) slv();

    return 0;
}
0